Sciweavers

2157 search results - page 18 / 432
» Optimal Fast Hashing
Sort
View
ASIAN
2004
Springer
69views Algorithms» more  ASIAN 2004»
15 years 11 months ago
Using Optimal Golomb Rulers for Minimizing Collisions in Closed Hashing
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 ...
Lars Lundberg, Håkan Lennerstad, Kamilla Klo...
ICMCS
2010
IEEE
178views Multimedia» more  ICMCS 2010»
15 years 7 months ago
Optimal configuration of hash table based multimedia fingerprint databases using weak bits
The increasingly large amount of digital multimedia content has created a need for technologies to search and identify multimedia files. Multimedia fingerprinting has been widely ...
Claus Bauer, Regunathan Radhakrishnan, Wenyu Jiang
SIAMCOMP
2008
63views more  SIAMCOMP 2008»
15 years 5 months ago
Uniform Hashing in Constant Time and Optimal Space
Anna Pagh, Rasmus Pagh
CVPR
2008
IEEE
16 years 8 months ago
Fast image search for learned metrics
We introduce a method that enables scalable image search for learned metrics. Given pairwise similarity and dissimilarity constraints between some images, we learn a Mahalanobis d...
Prateek Jain, Brian Kulis, Kristen Grauman