default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMariya Ishteva
Person information
- affiliation: KU Leuven, Belgium
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c15]Joppe De Jonghe, Konstantin Usevich, Philippe Dreesen
, Mariya Ishteva:
Compressing Neural Networks with Two-Layer Decoupling. CAMSAP 2023: 226-230- [c14]Prabhu Vijayan, Philippe Dreesen, Ivan Markovsky, Mariya Ishteva:
Parameter Estimation of Multiple Poles by Subspace-Based Method. CoDIT 2023: 1948-1953 - [c13]Konstantin Usevich, Yassine Zniyed, Mariya Ishteva, Philippe Dreesen, André L. F. de Almeida:
Tensor-Based Two-Layer Decoupling of Multivariate Polynomial Maps. EUSIPCO 2023: 655-659 - 2021
- [c12]Mariya Ishteva, Philippe Dreesen:
Solving Systems of Polynomial Equations - A Tensor Approach. LSSC 2021: 333-341 - 2020
- [j9]Konstantin Usevich, Philippe Dreesen, Mariya Ishteva:
Decoupling multivariate polynomials: Interconnections between tensorizations. J. Comput. Appl. Math. 363: 22-34 (2020)
2010 – 2019
- 2018
- [j8]Gabriel Hollander, Philippe Dreesen, Mariya Ishteva, Johan Schoukens:
Approximate decoupling of multivariate polynomials using weighted tensor decomposition. Numer. Linear Algebra Appl. 25(2) (2018) - [c11]Philippe Dreesen, Jeroen De Geeter, Mariya Ishteva:
Decoupling Multivariate Functions Using Second-Order Information and Tensors. LVA/ICA 2018: 79-88 - [i7]Philippe Dreesen, Jeroen De Geeter, Mariya Ishteva:
Decoupling multivariate functions using second-order information and tensors. CoRR abs/1805.08479 (2018) - 2017
- [c10]Philippe Dreesen, Koen Tiels, Mariya Ishteva, Johan Schoukens:
Nonlinear system identification: Finding structure in nonlinear black-box models. CAMSAP 2017: 1-4 - [c9]Philippe Dreesen, David T. Westwick, Johan Schoukens, Mariya Ishteva:
Modeling Parallel Wiener-Hammerstein Systems Using Tensor Decomposition of Volterra Kernels. LVA/ICA 2017: 16-25 - [c8]Gabriel Hollander, Philippe Dreesen, Mariya Ishteva, Johan Schoukens:
An Initialization Method for Nonlinear Model Reduction Using the CP Decomposition. LVA/ICA 2017: 111-120 - 2016
- [i6]Gabriel Hollander, Philippe Dreesen, Mariya Ishteva, Johan Schoukens:
Weighted tensor decomposition for approximate decoupling of multivariate polynomials. CoRR abs/1601.07800 (2016) - [i5]Philippe Dreesen, David T. Westwick, Johan Schoukens, Mariya Ishteva:
Modeling Parallel Wiener-Hammerstein Systems Using Tensor Decomposition of Volterra Kernels. CoRR abs/1609.08063 (2016) - 2015
- [j7]Philippe Dreesen, Mariya Ishteva, Johan Schoukens:
Decoupling Multivariate Polynomials Using First-Order Information and Tensor Decompositions. SIAM J. Matrix Anal. Appl. 36(2): 864-879 (2015) - [c7]Philippe Dreesen, Thomas Goossens, Mariya Ishteva, Lieven De Lathauwer, Johan Schoukens:
Block-Decoupling Multivariate Polynomials Using the Tensor Block-Term Decomposition. LVA/ICA 2015: 14-21 - [c6]Mariya Ishteva:
Tensors and Latent Variable Models. LVA/ICA 2015: 49-55 - 2014
- [j6]Ramakrishnan Kannan, Mariya Ishteva, Haesun Park:
Bounded matrix factorization for recommender system. Knowl. Inf. Syst. 39(3): 491-511 (2014) - [j5]Mariya Ishteva, Konstantin Usevich, Ivan Markovsky:
Factorization Approach to Structured Low-Rank Approximation with Applications. SIAM J. Matrix Anal. Appl. 35(3): 1180-1204 (2014) - [i4]Philippe Dreesen, Mariya Ishteva, Johan Schoukens:
Decoupling Multivariate Polynomials Using First-Order Information. CoRR abs/1410.4060 (2014) - 2013
- [j4]Mariya Ishteva, Pierre-Antoine Absil, Paul Van Dooren:
Jacobi Algorithm for the Best Low Multilinear Rank Approximation of Symmetric Tensors. SIAM J. Matrix Anal. Appl. 34(2): 651-672 (2013) - [c5]Mariya Ishteva, Haesun Park, Le Song:
Unfolding Latent Tree Structures using 4th Order Tensors. ICML (3) 2013: 316-324 - [c4]Le Song, Mariya Ishteva, Ankur P. Parikh, Eric P. Xing, Haesun Park:
Hierarchical Tensor Decomposition of Latent Tree Graphical Models. ICML (3) 2013: 334-342 - [i3]Mariya Ishteva, Konstantin Usevich, Ivan Markovsky:
Regularized structured low-rank approximation with applications. CoRR abs/1308.1827 (2013) - 2012
- [c3]Ramakrishnan Kannan, Mariya Ishteva, Haesun Park:
Bounded Matrix Low Rank Approximation. ICDM 2012: 319-328 - [c2]Ankur P. Parikh, Le Song, Mariya Ishteva, Gabi Teodoru, Eric P. Xing:
A Spectral Algorithm for Latent Junction Trees. UAI 2012: 675-684 - [i2]Mariya Ishteva, Haesun Park, Le Song:
Unfolding Latent Tree Structures using 4th Order Tensors. CoRR abs/1210.1258 (2012) - [i1]Ankur P. Parikh, Le Song, Mariya Ishteva, Gabi Teodoru, Eric P. Xing:
A Spectral Algorithm for Latent Junction Trees. CoRR abs/1210.4884 (2012) - 2011
- [j3]Mariya Ishteva, Pierre-Antoine Absil, Sabine Van Huffel, Lieven De Lathauwer:
Best Low Multilinear Rank Approximation of Higher-Order Tensors, Based on the Riemannian Trust-Region Scheme. SIAM J. Matrix Anal. Appl. 32(1): 115-135 (2011) - 2010
- [c1]Pierre B. Borckmans, Mariya Ishteva, Pierre-Antoine Absil:
A Modified Particle Swarm Optimization Algorithm for the Best Low Multilinear Rank Approximation of Higher-Order Tensors. ANTS Conference 2010: 13-23
2000 – 2009
- 2009
- [j2]Mariya Ishteva, Lieven De Lathauwer, Pierre-Antoine Absil, Sabine Van Huffel:
Differential-geometric Newton method for the best rank-(R1, R2, R3) approximation of tensors. Numer. Algorithms 51(2): 179-194 (2009) - [j1]Pierre-Antoine Absil, Mariya Ishteva, Lieven De Lathauwer, Sabine Van Huffel:
A Geometric Newton Method for Oja's Vector Field. Neural Comput. 21(5): 1415-1433 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
