Sciweavers

PPOPP
2012
ACM
12 years 8 months ago
CPHASH: a cache-partitioned hash table
CPHASH is a concurrent hash table for multicore processors. CPHASH partitions its table across the caches of cores and uses message passing to transfer lookups/inserts to a partit...
Zviad Metreveli, Nickolai Zeldovich, M. Frans Kaas...
ICDAR
2011
IEEE
13 years 1 days ago
Recognizing Characters with Severe Perspective Distortion Using Hash Tables and Perspective Invariants
—In this paper, we present a novel method to recognize characters with severe perspective distortion using hash tables and perspective invariants. The proposed algorithm consists...
Pan Pan, Yuanping Zhu, Jun Sun 0004, Satoshi Naoi
ICCV
2011
IEEE
13 years 13 days ago
Complementary Hashing for Approximate Nearest Neighbor Search
Recently, hashing based Approximate Nearest Neighbor (ANN) techniques have been attracting lots of attention in computer vision. The data-dependent hashing methods, e.g., Spectral...
Hao Xu, Jingdong Wang, Zhu Li, Gang Zeng, Shipeng ...
TON
2008
89views more  TON 2008»
13 years 11 months ago
Simple summaries for hashing with choices
In a multiple-choice hashing scheme, each item is stored in one of 2 possible hash table buckets. The availability of these multiple choices allows for a substantial reduction in t...
Adam Kirsch, Michael Mitzenmacher
ALGORITHMICA
2008
95views more  ALGORITHMICA 2008»
14 years 1 days ago
Optimality in External Memory Hashing
Hash tables on external memory are commonly used for indexing in database management systems. In this paper we present an algorithm that, in an asymptotic sense, achieves the best...
Morten Skaarup Jensen, Rasmus Pagh
CCR
2004
113views more  CCR 2004»
14 years 8 days ago
Implementing aggregation and broadcast over Distributed Hash Tables
Peer-to-peer (P2P) networks represent an effective way to share information, since there are no central points of failure or bottleneck. However, the flip side to the distributive...
Ji Li, Karen R. Sollins, Dah-Yoh Lim
PSB
2003
14 years 1 months ago
MAP: Searching Large Genome Databases
A number of biological applications require comparison of large genome strings. Current techniques suffer from both disk I/O and computational cost because of extensive memory req...
Tamer Kahveci, Ambuj K. Singh
SBBD
2008
256views Database» more  SBBD 2008»
14 years 1 months ago
Indexing Internal Memory with Minimal Perfect Hash Functions
A perfect hash function (PHF) is an injective function that maps keys from a set S to unique values, which are in turn used to index a hash table. Since no collisions occur, each k...
Fabiano C. Botelho, Hendrickson R. Langbehn, Guilh...
BIOCOMP
2007
14 years 1 months ago
Quality-Based Similarity Search for Biological Sequence Databases
Low-Complexity Regions (LCRs) of biological sequences are the main source of false positives in similarity searches for biological sequence databases. We consider the problem of ï...
Xuehui Li, Tamer Kahveci
ICALP
1994
Springer
14 years 4 months ago
Simple Fast Parallel Hashing
A hash table is a representation of a set in a linear size data structure that supports constanttime membership queries. We show how to construct a hash table for any given set of...
Joseph Gil, Yossi Matias