3055 search results - page 194 / 611 » Randomized Search Trees |
132
Voted
DEXA
2008
Springer
15 years 4 months ago
2008
Springer
So far, an efficient similarity search in multimedia databases has been carried out by metric access methods (MAMs), where the utilized similarity measure had to satisfy the metric...
88
Voted
ACL
2008
15 years 4 months ago
2008
This paper is concerned with the problem of question search. In question search, given a question as query, we are to return questions semantically equivalent or close to the quer...
117
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
108
Voted
COCO
2009
Springer
15 years 6 months ago
2009
Springer
Abstract--We study the 2-party randomized communication complexity of read-once AC0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication ...
117
click to vote
GLOBECOM
2006
IEEE
15 years 8 months ago
2006
IEEE
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...