502 search results - page 15 / 101 » Deploying a New Hash Algorithm |
235
Voted
ICDE
2012
IEEE
13 years 2 months ago
2012
IEEE
We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...
ASIAN
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We give conditions for hash table probing which minimize the expected number of collisions. A probing algorithm is determined by a sequence of numbers denoting jumps for ...
156
Voted
SIGCOMM
1997
ACM
15 years 3 months ago
1997
ACM
Internet address lookup is a challenging problem because of increasing routing table sizes, increased traffic, higher speed links, and the migration to 128 bit IPv6 addresses. IP...
127
Voted
DATE
2004
IEEE
15 years 3 months ago
2004
IEEE
Designing cost-sensitive real-time control systems for safetycritical applications requires a careful analysis of the cost/coverage trade-offs of fault-tolerant solutions. This fu...
107
Voted
COCO
2010
Springer
15 years 23 days ago
2010
Springer
We investigate the question of what languages can be decided efficiently with the help of a recursive collisionfinding oracle. Such an oracle can be used to break collisionresistan...