Sciweavers

204 search results - page 3 / 41
» Probabilistic Attributed Hashing
Sort
View
ICALP
1994
Springer
13 years 9 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
FMCAD
2004
Springer
13 years 9 months ago
Bloom Filters in Probabilistic Verification
Abstract. Probabilistic techniques for verification of finite-state transition systems offer huge memory savings over deterministic techniques. The two leading probabilistic scheme...
Peter C. Dillinger, Panagiotis Manolios
KDD
2012
ACM
188views Data Mining» more  KDD 2012»
11 years 7 months ago
A probabilistic model for multimodal hash function learning
In recent years, both hashing-based similarity search and multimodal similarity search have aroused much research interest in the data mining and other communities. While hashing-...
Yi Zhen, Dit-Yan Yeung
ANCS
2005
ACM
13 years 11 months ago
Segmented hash: an efficient hash table implementation for high performance networking subsystems
Hash tables provide efficient table implementations, achieving O(1), query, insert and delete operations at low loads. However, at moderate or high loads collisions are quite freq...
Sailesh Kumar, Patrick Crowley
ICDM
2007
IEEE
122views Data Mining» more  ICDM 2007»
13 years 11 months ago
Representing Tuple and Attribute Uncertainty in Probabilistic Databases
There has been a recent surge in work in probabilistic databases, propelled in large part by the huge increase in noisy data sources — sensor data, experimental data, data from ...
Prithviraj Sen, Amol Deshpande, Lise Getoor