default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristos Boutsidis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j11]Christos Boutsidis, David P. Woodruff:
Optimal CUR Matrix Decompositions. SIAM J. Comput. 46(2): 543-589 (2017)- 2016
- [c17]Malik Magdon-Ismail, Christos Boutsidis:
Optimal Sparse Linear Encoders and Sparse PCA. NIPS 2016: 298-306 - [c16]Christos Boutsidis, David P. Woodruff, Peilin Zhong:
Optimal principal component analysis in distributed and streaming models. STOC 2016: 236-249 - 2015
- [j10]Christos Boutsidis, Anastasios Zouzias, Michael W. Mahoney, Petros Drineas
:
Randomized Dimensionality Reduction for k-Means Clustering. IEEE Trans. Inf. Theory 61(2): 1045-1062 (2015) - [c15]Christos Boutsidis, Prabhanjan Kambadur, Alex Gittens:
Spectral Clustering via the Power Method - Provably. ICML 2015: 40-48 - [c14]Christos Boutsidis, Dan Garber, Zohar Shay Karnin, Edo Liberty:
Online Principal Components Analysis. SODA 2015: 887-901 - [i22]Christos Boutsidis, Edo Liberty, Maxim Sviridenko:
Greedy Minimization of Weakly Supermodular Set Functions. CoRR abs/1502.06528 (2015) - [i21]Malik Magdon-Ismail, Christos Boutsidis:
Optimal Sparse Linear Auto-Encoders and Sparse PCA. CoRR abs/1502.06626 (2015) - [i20]Christos Boutsidis, Petros Drineas, Prabhanjan Kambadur, Anastasios Zouzias:
A Randomized Algorithm for Approximating the Log Determinant of a Symmetric Positive Definite Matrix. CoRR abs/1503.00374 (2015) - [i19]Christos Boutsidis, David P. Woodruff:
Communication-optimal Distributed Principal Component Analysis in the Column-partition Model. CoRR abs/1504.06729 (2015) - 2014
- [j9]Christos Boutsidis, Malik Magdon-Ismail:
A note on sparse least-squares regression. Inf. Process. Lett. 114(5): 273-276 (2014) - [j8]Christos Boutsidis, Petros Drineas, Malik Magdon-Ismail:
Near-Optimal Column-Based Matrix Reconstruction. SIAM J. Comput. 43(2): 687-717 (2014) - [j7]Haim Avron, Christos Boutsidis, Sivan Toledo, Anastasios Zouzias:
Efficient Dimensionality Reduction for Canonical Correlation Analysis. SIAM J. Sci. Comput. 36(5) (2014) - [j6]Saurabh Paul, Christos Boutsidis, Malik Magdon-Ismail, Petros Drineas:
Random Projections for Linear Support Vector Machines. ACM Trans. Knowl. Discov. Data 8(4): 22:1-22:25 (2014) - [c13]Christos Boutsidis, Malik Magdon-Ismail:
Faster SVD-truncated regularized least-squares. ISIT 2014: 1321-1325 - [c12]Dimitris S. Papailiopoulos, Anastasios Kyrillidis, Christos Boutsidis:
Provable deterministic leverage score sampling. KDD 2014: 997-1006 - [c11]Christos Boutsidis, David P. Woodruff:
Optimal CUR matrix decompositions. STOC 2014: 353-362 - [i18]Christos Boutsidis, Malik Magdon-Ismail:
Faster SVD-Truncated Least-Squares Regression. CoRR abs/1401.0417 (2014) - [i17]Dimitris S. Papailiopoulos, Anastasios Kyrillidis, Christos Boutsidis:
Provable Deterministic Leverage Score Sampling. CoRR abs/1404.1530 (2014) - [i16]Christos Boutsidis, David P. Woodruff:
Optimal CUR Matrix Decompositions. CoRR abs/1405.7910 (2014) - 2013
- [j5]Christos Boutsidis, Alex Gittens:
Improved Matrix Algorithms via the Subsampled Randomized Hadamard Transform. SIAM J. Matrix Anal. Appl. 34(3): 1301-1340 (2013) - [j4]Haim Avron, Christos Boutsidis:
Faster Subset Selection for Matrices and Applications. SIAM J. Matrix Anal. Appl. 34(4): 1464-1499 (2013) - [j3]Christos Boutsidis, Malik Magdon-Ismail:
Deterministic Feature Selection for $k$-Means Clustering. IEEE Trans. Inf. Theory 59(9): 6099-6110 (2013) - [j2]Christos Boutsidis, Petros Drineas, Malik Magdon-Ismail:
Near-Optimal Coresets for Least-Squares Regression. IEEE Trans. Inf. Theory 59(10): 6880-6892 (2013) - [c10]Saurabh Paul, Christos Boutsidis, Malik Magdon-Ismail, Petros Drineas:
Random Projections for Support Vector Machines. AISTATS 2013: 498-506 - [c9]Christos Boutsidis, Dmitry Malioutov:
Equity factor analysis via column subset selection. GlobalSIP 2013: 1131 - [c8]Haim Avron, Christos Boutsidis, Sivan Toledo, Anastasios Zouzias:
Efficient Dimensionality Reduction for Canonical Correlation Analysis. ICML (1) 2013: 347-355 - [i15]Alex Gittens, Prabhanjan Kambadur, Christos Boutsidis:
Approximate Spectral Clustering via Randomized Sketching. CoRR abs/1311.2854 (2013) - [i14]Christos Boutsidis, Malik Magdon-Ismail:
A note on sparse least-squares regression. CoRR abs/1312.7499 (2013) - 2012
- [i13]Haim Avron, Christos Boutsidis:
Faster Subset Selection for Matrices and Applications. CoRR abs/1201.0127 (2012) - [i12]Christos Boutsidis, Petros Drineas, Malik Magdon-Ismail:
Rich Coresets For Constrained Linear Regression. CoRR abs/1202.3505 (2012) - [i11]Christos Boutsidis, Alex Gittens:
Improved matrix algorithms via the Subsampled Randomized Hadamard Transform. CoRR abs/1204.0062 (2012) - [i10]Haim Avron, Christos Boutsidis, Sivan Toledo, Anastasios Zouzias:
Efficient Dimensionality Reduction for Canonical Correlation Analysis. CoRR abs/1209.2185 (2012) - [i9]B. Cung, T. Jin, Juan Ramirez, A. Thompson, Christos Boutsidis, Deanna Needell:
Spectral Clustering: An empirical study of Approximation Algorithms and its Application to the Attrition Problem. CoRR abs/1211.3444 (2012) - [i8]Saurabh Paul, Christos Boutsidis, Malik Magdon-Ismail, Petros Drineas:
Random Projections for Support Vector Machines. CoRR abs/1211.6085 (2012) - 2011
- [b1]Christos Boutsidis:
Topics in matrix sampling algorithms. Rensselaer Polytechnic Institute, USA, 2011 - [c7]Christos Boutsidis, Petros Drineas, Malik Magdon-Ismail:
Near Optimal Column-Based Matrix Reconstruction. FOCS 2011: 305-314 - [c6]Christos Boutsidis, Petros Drineas, Malik Magdon-Ismail:
Sparse Features for PCA-Like Linear Regression. NIPS 2011: 2285-2293 - [i7]Christos Boutsidis, Petros Drineas, Malik Magdon-Ismail:
Near-Optimal Column-Based Matrix Reconstruction. CoRR abs/1103.0995 (2011) - [i6]Christos Boutsidis:
Topics in Matrix Sampling Algorithms. CoRR abs/1105.0709 (2011) - [i5]Christos Boutsidis, Malik Magdon-Ismail:
Deterministic Feature Selection for $k$-means Clustering. CoRR abs/1109.5664 (2011) - [i4]Christos Boutsidis, Anastasios Zouzias, Michael W. Mahoney, Petros Drineas:
Stochastic Dimensionality Reduction for K-means Clustering. CoRR abs/1110.2897 (2011) - 2010
- [c5]Christos Boutsidis, Anastasios Zouzias, Petros Drineas:
Random Projections for $k$-means Clustering. NIPS 2010: 298-306 - [i3]Christos Boutsidis, Anastasios Zouzias, Petros Drineas:
Random Projections for $k$-means Clustering. CoRR abs/1011.4632 (2010)
2000 – 2009
- 2009
- [c4]Christos Boutsidis, Michael W. Mahoney, Petros Drineas:
Unsupervised Feature Selection for the $k$-means Clustering Problem. NIPS 2009: 153-161 - [c3]Christos Boutsidis, Michael W. Mahoney, Petros Drineas:
An improved approximation algorithm for the column subset selection problem. SODA 2009: 968-977 - 2008
- [j1]Christos Boutsidis, Efstratios Gallopoulos:
SVD based initialization: A head start for nonnegative matrix factorization. Pattern Recognit. 41(4): 1350-1362 (2008) - [c2]Christos Boutsidis, Jimeng Sun, Nikos Anerousis:
Clustered subset selection and its applications on it service metrics. CIKM 2008: 599-608 - [c1]Christos Boutsidis, Michael W. Mahoney, Petros Drineas:
Unsupervised feature selection for principal components analysis. KDD 2008: 61-69 - [i2]Christos Boutsidis, Michael W. Mahoney, Petros Drineas:
An Improved Approximation Algorithm for the Column Subset Selection Problem. CoRR abs/0812.4293 (2008) - [i1]Christos Boutsidis, Petros Drineas:
Random Projections for the Nonnegative Least-Squares Problem. CoRR abs/0812.4547 (2008)
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-24 22:49 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:
