default search action
Paris Giampouras
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i13]Paris Giampouras, HanQin Cai, René Vidal:
Guarantees of a Preconditioned Subgradient Algorithm for Overparameterized Asymmetric Low-rank Matrix Recovery. CoRR abs/2410.16826 (2024) - 2023
- [j8]Athanasios A. Rontogiannis, Eleftherios Kofidis, Paris V. Giampouras:
Online rank-revealing block-term tensor decomposition. Signal Process. 212: 109126 (2023) - [c18]Christiaan Lamers, René Vidal, Nabil Belbachir, Niki van Stein
, Thomas Bäck
Clustering-based Domain-Incremental Learning. ICCV (Workshops) 2023: 3376-3384 - [c17]Liangzu Peng, Paris Giampouras, René Vidal:
The Ideal Continual Learner: An Agent That Never Forgets. ICML 2023: 27585-27610 - [i12]Liangzu Peng, Paris V. Giampouras, René Vidal:
The Ideal Continual Learner: An Agent That Never Forgets. CoRR abs/2305.00316 (2023) - [i11]Darshan Thaker, Paris Giampouras, René Vidal:
A Linearly Convergent GAN Inversion-based Algorithm for Reverse Engineering of Deceptions. CoRR abs/2306.04756 (2023) - [i10]Christiaan Lamers, René Vidal, Ahmed Nabil Belbachir, Niki van Stein, Thomas Bäck, Paris Giampouras:
Clustering-based Domain-Incremental Learning. CoRR abs/2309.12078 (2023) - 2022
- [j7]Paris V. Giampouras
Block-Term Tensor Decomposition Model Selection and Computation: The Bayesian Way. IEEE Trans. Signal Process. 70: 1704-1717 (2022) - [c16]Eleftherios Kofidis, Paris V. Giampouras, Athanasios A. Rontogiannis:
A Projected Newton-type Algorithm for Rank - revealing Nonnegative Block - Term Tensor Decomposition. EUSIPCO 2022: 1961-1965 - [c15]Paris Giampouras, Benjamin David Haeffele, René Vidal:
Implicit Bias of Projected Subgradient Method Gives Provable Robust Recovery of Subspaces of Unknown Codimension. ICLR 2022 - [c14]Darshan Thaker, Paris Giampouras, René Vidal:
Reverse Engineering ℓp attacks: A block-sparse optimization approach with recovery guarantees. ICML 2022: 21253-21271 - [i9]Paris V. Giampouras, Benjamin D. Haeffele, René Vidal:
Implicit Bias of Projected Subgradient Method Gives Provable Robust Recovery of Subspaces of Unknown Codimension. CoRR abs/2201.09079 (2022) - [i8]Darshan Thaker, Paris Giampouras, René Vidal:
Reverse Engineering 𝓁p attacks: A block-sparse optimization approach with recovery guarantees. CoRR abs/2203.04886 (2022) - 2021
- [j6]Athanasios A. Rontogiannis
Block-Term Tensor Decomposition: Model Selection and Computation. IEEE J. Sel. Top. Signal Process. 15(3): 464-475 (2021) - [c13]Athanasios A. Rontogiannis, Eleftherios Kofidis, Paris V. Giampouras:
Online Rank-Revealing Block-Term Tensor Decomposition. ACSCC 2021: 1678-1682 - [c12]Paris V. Giampouras, Athanasios A. Rontogiannis, Eleftherios Kofidis:
A Bayesian Approach to Block-Term Tensor Decomposition Model Selection and Computation. EUSIPCO 2021: 1800-1804 - [c11]Athanasios A. Rontogiannis, Paris V. Giampouras, Eleftherios Kofidis:
Rank-Revealing Block-Term Decomposition for Tensor Completion. ICASSP 2021: 2915-2919 - [i7]Paris V. Giampouras, Athanasios A. Rontogiannis, Eleftherios Kofidis:
A Bayesian Approach to Block-Term Tensor Decomposition Model Selection and Computation. CoRR abs/2101.02931 (2021) - [i6]Athanasios A. Rontogiannis, Eleftherios Kofidis, Paris V. Giampouras:
Online Rank-Revealing Block-Term Tensor Decomposition. CoRR abs/2106.10755 (2021) - 2020
- [j5]Athanasios A. Rontogiannis
Online Reweighted Least Squares Robust PCA. IEEE Signal Process. Lett. 27: 1340-1344 (2020) - [c10]Athanasios A. Rontogiannis, Eleftherios Kofidis, Paris V. Giampouras:
Block-Term Tensor Decomposition: Model Selection and Computation. EUSIPCO 2020: 1976-1980 - [c9]Paris Giampouras, René Vidal, Athanasios A. Rontogiannis, Benjamin D. Haeffele:
A novel variational form of the Schatten-$p$ quasi-norm. NeurIPS 2020 - [i5]Athanasios A. Rontogiannis, Eleftherios Kofidis, Paris V. Giampouras:
Block-Term Tensor Decomposition: Model Selection and Computation. CoRR abs/2002.09759 (2020) - [i4]Paris Giampouras, René Vidal, Athanasios A. Rontogiannis, Benjamin D. Haeffele:
A novel variational form of the Schatten-p quasi-norm. CoRR abs/2010.13927 (2020)
2010 – 2019
- 2019
- [j4]Paris V. Giampouras
Alternating Iteratively Reweighted Least Squares Minimization for Low-Rank Matrix Factorization. IEEE Trans. Signal Process. 67(2): 490-503 (2019) - [c8]Paris V. Giampouras, Athanasios A. Rontogiannis, Konstantinos D. Koutroumbas:
A Projected Newton-type Algorithm for Nonnegative Matrix Factorization with Model Order Selection. ICASSP 2019: 3497-3501 - 2018
- [j3]Ioannis C. Tsaknakis
A Computationally Efficient Tensor Completion Algorithm. IEEE Signal Process. Lett. 25(8): 1266-1270 (2018) - [c7]Paris V. Giampouras, Athanasios A. Rontogiannis, Konstantinos D. Koutroumbas:
Robust PCA via Alternating Iteratively Reweighted Low-Rank Matrix Factorization. ICIP 2018: 3383-3387 - 2017
- [j2]Paris V. Giampouras, Athanasios A. Rontogiannis, Konstantinos E. Themelis
Online sparse and low-rank subspace learning from incomplete data: A Bayesian view. Signal Process. 137: 199-212 (2017) - [c6]Paris V. Giampouras, Athanasios A. Rontogiannis, Konstantinos D. Koutroumbas:
Low-rank and sparse NMF for joint endmembers' number estimation and blind unmixing of hyperspectral images. EUSIPCO 2017: 1430-1434 - [i3]Paris V. Giampouras, Athanasios A. Rontogiannis, Konstantinos D. Koutroumbas:
Low-rank and Sparse NMF for Joint Endmembers' Number Estimation and Blind Unmixing of Hyperspectral Images. CoRR abs/1703.05785 (2017) - [i2]Paris V. Giampouras, Athanasios A. Rontogiannis, Konstantinos D. Koutroumbas:
Alternating Iteratively Reweighted Minimization Algorithms for Low-Rank Matrix Factorization. CoRR abs/1710.02004 (2017) - 2016
- [j1]Paris V. Giampouras, Konstantinos E. Themelis
Simultaneously Sparse and Low-Rank Abundance Matrix Estimation for Hyperspectral Image Unmixing. IEEE Trans. Geosci. Remote. Sens. 54(8): 4775-4789 (2016) - [c5]Paris V. Giampouras, Athanasios A. Rontogiannis, Konstantinos D. Koutroumbas:
Online low-rank subspace learning from incomplete data using rank revealing ℓ2/ℓ1 regularization. SSP 2016: 1-5 - 2015
- [c4]Paris Giampouras, Athanasios A. Rontogiannis, Konstantinos E. Themelis, Konstantinos Koutroumbas:
Online Bayesian low-rank subspace learning from partial observations. EUSIPCO 2015: 2526-2530 - [c3]Paris V. Giampouras, Konstantinos E. Themelis, Athanasios A. Rontogiannis, Konstantinos D. Koutroumbas:
Hyperspectral image unmixing via simultaneously sparse and low rank abundance matrix estimation. WHISPERS 2015: 1-4 - [i1]Paris Giampouras, Konstantinos Themelis, Athanasios A. Rontogiannis, Konstantinos Koutroumbas:
Simultaneously sparse and low-rank abundance matrix estimation for hyperspectral image unmixing. CoRR abs/1504.01515 (2015) - 2014
- [c2]Paris V. Giampouras, Konstantinos E. Themelis, Athanasios A. Rontogiannis, Konstantinos D. Koutroumbas:
A variational Bayes algorithm for joint-sparse abundance estimation. WHISPERS 2014: 1-4 - 2013
- [c1]Paris Giampouras, Eleni Charou, Anastasios L. Kesidis:
Artificial Neural Network Approach for Land Cover Classification of Fused Hyperspectral and Lidar Data. AIAI 2013: 255-261
Coauthor Index
aka: Konstantinos D. Koutroumbas
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-12-01 00:17 CET 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: