5153 search results - page 288 / 1031 » Introduction to Randomized Algorithms |
138
click to vote
DCC
2001
IEEE
16 years 3 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...
130
click to vote
CP
2007
Springer
15 years 10 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...
RANDOM
1998
Springer
15 years 8 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...
123
click to vote
WADS
1989
Springer
15 years 7 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...
138
click to vote
IROS
2009
IEEE
15 years 10 months ago
2009
IEEE
— The paper presents a navigation algorithm for dynamic, uncertain environment. The static environment is unknown, while moving pedestrians are detected and tracked on-line. Pede...