Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Mahoney, Michael W."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regression
Xiangrui Meng
,
Michael W. Mahoney
Proceedings of the 45th ACM Symposium on Theory of Computing, STOC'2013 (Palo Alto, California, USA, June 1-4, 2013)
, 2013, pp. 91-100
On the hyperbolicity of small-world and tree-like random graphs
Wei Chen
,
Wenjie Fang
,
Guangda Hu
,
Michael W. Mahoney
Lecture Notes in Computer Science
7676
, 2012, pp. 278-288
Sampling algorithms and coresets for
\l_p
regression
Anirban Dasgupta
,
Petros Drineas
,
Boulos Harb
,
Ravi Kumar
,
Michael W. Mahoney
SIAM Journal on Computing
38
(5), 2008-2009, pp. 2060-2078
Fast Monte Carlo algorithms for matrices I: Approximating matrix multiplication
Petros Drineas
,
Ravi Kannan
,
Michael W. Mahoney
SIAM Journal on Computing
36
(1), 2006, pp. 132-157
Fast Monte Carlo algorithms for matrices II: Computing a low-rank approximation to a matrix
Petros Drineas
,
Ravi Kannan
,
Michael W. Mahoney
SIAM Journal on Computing
36
(1), 2006, pp. 158-183
Fast Monte Carlo algorithms for matrices III: Computing a compressed approximate matrix decomposition
Petros Drineas
,
Ravi Kannan
,
Michael W. Mahoney
SIAM Journal on Computing
36
(1), 2006, pp. 184-206
Subspace sampling and relative-error matrix approximation: Column-row-based methods
Petros Drineas
,
Michael W. Mahoney
,
S. Muthukrishnan
Lecture Notes in Computer Science
4168
, 2006, pp. 304-314
Sampling sub-problems of heterogeneous max-cut problems and approximation algorithms
Petros Drineas
,
Ravi Kannan
,
Michael W. Mahoney
Lecture Notes in Computer Science
3404
, 2005, pp. 57-68
Rapid mixing of several Markov chains for a hard-core model
Ravi Kannan
,
Michael W. Mahoney
,
Ravi Montenegro
Lecture Notes in Computer Science
2906
, 2003, pp. 663-675