5115 search results - page 60 / 1023 » On Randomized Lanczos Algorithms |
CORR
2010
Springer
14 years 12 months ago
2010
Springer
Random Indexing K-tree is the combination of two algorithms suited for large scale document clustering. Keywords Random Indexing, K-tree, Dimensionality Reduction, B-tree, Search T...
RSA
2002
14 years 11 months ago
2002
: We analyze the (3, 2, 1)-Shell Sort algorithm under the usual random permutation model.
120
click to vote
SODA
2012
ACM
13 years 2 months ago
2012
ACM
We resolve the problem of small-space approximate selection in random-order streams. Specifically, we present an algorithm that reads the n elements of a set in random order and ...
CISS
2008
IEEE
15 years 6 months ago
2008
IEEE
— We develop distributed scheduling schemes that are based on simple random access algorithms and that have no message passing. In spite of their simplicity, these schemes are sh...
128
click to vote
JMLR
2012
13 years 2 months ago
2012
We address the problem of finding the most likely assignment or MAP estimation in a Markov random field. We analyze the linear programming formulation of MAP through the lens of...