3055 search results - page 477 / 611 » Randomized Search Trees |
123
click to vote
SPAA
1998
ACM
15 years 8 months ago
1998
ACM
We present parallel algorithms for union, intersection and difference on ordered sets using random balanced binary trees (treaps [26]). For two sets of size n and m (m ≤ n) the...
155
click to vote
ACIVS
2006
Springer
15 years 8 months ago
2006
Springer
We address the topic of real-time analysis and recognition of silhouettes. The method that we propose first produces object features obtained by a new type of morphological operato...
132
click to vote
CAAN
2006
Springer
15 years 8 months ago
2006
Springer
Gossiping is a communication primitive where each node of a network possesses a unique message that is to be communicated to all other nodes in the network. We study the gossiping ...
165
click to vote
FOCS
2004
IEEE
15 years 8 months ago
2004
IEEE
Stochastic optimization problems attempt to model uncertainty in the data by assuming that (part of) the input is specified in terms of a probability distribution. We consider the...
155
click to vote
EUROPAR
2009
Springer
15 years 7 months ago
2009
Springer
Whereas traditional Desktop Grids rely on centralized servers for data management, some recent progress has been made to enable distributed, large input data, using to peer-to-peer...