3055 search results - page 395 / 611 » Randomized Search Trees |
113
click to vote
INTR
2002
15 years 3 months ago
2002
There have been many attempts to study the content of the web, either through human or automatic agents. Five different previously used web survey methodologies are described and ...
148
click to vote
STOC
2003
ACM
16 years 4 months ago
2003
ACM
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random fu...
136
click to vote
EUROPAR
2009
Springer
15 years 10 months ago
2009
Springer
Selecting a random peer with uniform probability across a peer-to-peer (P2P) network is a fundamental function for unstructured search, data replication, and monitoring algorithms....
122
click to vote
CANS
2005
Springer
15 years 9 months ago
2005
Springer
In Eurocrypt’05, Wang et al. presented new techniques to find collisions of Hash function MD4. The techniques are not only efficient to search for collisions, but also applicabl...
145
click to vote
ICNP
2002
IEEE
15 years 9 months ago
2002
IEEE
Abstract— Internet flash crowds (a.k.a. hot spots) are a phenomenon that result from a sudden, unpredicted increase in an on-line object’s popularity. Currently, there is no e...