5115 search results - page 280 / 1023 » On Randomized Lanczos Algorithms |
186
click to vote
ICML
2006
IEEE
16 years 8 months ago
2006
IEEE
We consider the problem of clustering in its most basic form where only a local metric on the data space is given. No parametric statistical model is assumed, and the number of cl...
192
click to vote
DCC
2001
IEEE
16 years 6 months ago
2001
IEEE
We consider the problem of compressing graphs of the link structure of the World Wide Web. We provide efficient algorithms for such compression that are motivated by recently prop...
180
click to vote
CP
2007
Springer
16 years 1 months ago
2007
Springer
Probabilistic Choice Operators (PCOs) are convenient tools to model uncertainty in CP. They are useful to implement randomized algorithms and stochastic processes in the concurrent...
147
click to vote
RANDOM
1998
Springer
15 years 11 months ago
1998
Springer
abstract for submission to Random '98 not for distribution Andrei Z. Broder Moses Charikar Michael Mitzenmacher Min-wise independence is a recently introduced notion of limit...
188
click to vote
WADS
1989
Springer
15 years 11 months ago
1989
Springer
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...