5153 search results - page 66 / 1031 » Introduction to Randomized Algorithms |
123
click to vote
SODA
2012
ACM
13 years 6 days ago
2012
ACM
Motivated by online ad allocation, we study the problem of simultaneous approximations for the adversarial and stochastic online budgeted allocation problem. This problem consists...
CORR
2010
Springer
14 years 10 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 9 months ago
2002
: We analyze the (3, 2, 1)-Shell Sort algorithm under the usual random permutation model.
106
click to vote
SODA
2012
ACM
13 years 6 days 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 4 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...