default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVassilis Kalofolias
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2016
[b1]Vassilis Kalofolias:
From data to structures - graph learning under smoothness assumptions and applications in data science. EPFL, Switzerland, 2016
Journal Articles
- 2016
- [j1]Nauman Shahid
, Nathanaël Perraudin, Vassilis Kalofolias, Gilles Puy, Pierre Vandergheynst:
Fast Robust PCA on Graphs. IEEE J. Sel. Top. Signal Process. 10(4): 740-756 (2016)
Conference and Workshop Papers
- 2019
- [c6]Vassilis Kalofolias, Nathanaël Perraudin:
Large Scale Graph Learning From Smooth Signals. ICLR (Poster) 2019 - 2017
- [c5]Vassilis Kalofolias, Andreas Loukas, Dorina Thanou, Pascal Frossard:
Learning time varying graphs. ICASSP 2017: 2826-2830 - 2016
- [c4]Vassilis Kalofolias:
How to Learn a Graph from Smooth Signals. AISTATS 2016: 920-929 - [c3]Kirell Benzi, Vassilis Kalofolias, Xavier Bresson, Pierre Vandergheynst:
Song recommendation with non-negative matrix factorization and graph total variation. ICASSP 2016: 2439-2443 - [c2]Nauman Shahid, Nathanaël Perraudin, Vassilis Kalofolias, Benjamin Ricaud, Pierre Vandergheynst:
PCA using graph total variation. ICASSP 2016: 4668-4672 - 2015
- [c1]Nauman Shahid, Vassilis Kalofolias, Xavier Bresson, Michael M. Bronstein, Pierre Vandergheynst:
Robust Principal Component Analysis on Graphs. ICCV 2015: 2812-2820
Informal and Other Publications
- 2017
- [i7]Vassilis Kalofolias, Nathanaël Perraudin:
Large Scale Graph Learning from Smooth Signals. CoRR abs/1710.05654 (2017) - 2016
- [i6]Kirell Benzi, Vassilis Kalofolias, Xavier Bresson, Pierre Vandergheynst:
Song Recommendation with Non-Negative Matrix Factorization and Graph Total Variation. CoRR abs/1601.01892 (2016) - [i5]Vassilis Kalofolias:
How to learn a graph from smooth signals. CoRR abs/1601.02513 (2016) - 2015
- [i4]Nauman Shahid, Vassilis Kalofolias, Xavier Bresson, Michael M. Bronstein, Pierre Vandergheynst:
Robust Principal Component Analysis on Graphs. CoRR abs/1504.06151 (2015) - [i3]Nauman Shahid, Nathanaël Perraudin, Vassilis Kalofolias, Pierre Vandergheynst:
Fast Robust PCA on Graphs. CoRR abs/1507.08173 (2015) - 2014
- [i2]Vassilis Kalofolias, Xavier Bresson, Michael M. Bronstein, Pierre Vandergheynst:
Matrix Completion on Graphs. CoRR abs/1408.1717 (2014) - [i1]Nathanaël Perraudin, Johan Paratte, David I. Shuman, Vassilis Kalofolias, Pierre Vandergheynst, David K. Hammond:
GSPBOX: A toolbox for signal processing on graphs. CoRR abs/1408.5781 (2014)
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-04-25 05:47 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:
