1385 search results - page 79 / 277 » Clustering by Random Projections |
138
click to vote
STOC
2006
ACM
16 years 5 months ago
2006
ACM
We present the first randomized polynomial-time simplex algorithm for linear programming. Like the other known polynomial-time algorithms for linear programming, its running time ...
136
Voted
COCO
1994
Springer
15 years 9 months ago
1994
Springer
Resource-bounded measure as originated by Lutz is an extension of classical measure theory which provides a probabilistic means of describing the relative sizes of complexity clas...
143
click to vote
NIPS
2007
15 years 6 months ago
2007
This paper investigates the application of randomized algorithms for large scale SVM learning. The key contribution of the paper is to show that, by using ideas random projections...
149
click to vote
DAGM
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Approximations based on random Fourier features have recently emerged as an efficient and elegant methodology for designing large-scale kernel machines [4]. By expressing...
121
click to vote
JACM
2011
14 years 12 months ago
2011
We analyze the convergence of randomized trace estimators. Starting at 1989, several algorithms have been proposed for estimating the trace of a matrix by 1 M M i=1 zT i Azi, where...