Sciweavers

4438 search results - page 61 / 888
» On the Distribution of Keys by Hashing
Sort
View
ICASSP
2009
IEEE
15 years 6 months ago
Rate-constrained distributed distance testing and its applications
We investigate a practical approach to solving one instantiation of a distributed hypothesis testing problem under severe rate constraints that shows up in a wide variety of appli...
Chuohao Yeo, Parvez Ahammad, Hao Zhang, Kannan Ram...
ICPR
2010
IEEE
15 years 3 months ago
Beyond "Near-Duplicates": Learning Hash Codes for Efficient Similar-Image Retrieval
Finding similar images in a large database is an important, but often computationally expensive, task. In this paper, we present a two-tier similar-image retrieval system with the...
Shumeet Baluja, Michele Covell
TPDS
1998
122views more  TPDS 1998»
14 years 11 months ago
Managing Statistical Behavior of Large Data Sets in Shared-Nothing Architectures
—Increasingly larger data sets are being stored in networked architectures. Many of the available data structures are not easily amenable to parallel realizations. Hashing scheme...
Isidore Rigoutsos, Alex Delis
APPROX
2008
Springer
71views Algorithms» more  APPROX 2008»
15 years 1 months ago
Tight Bounds for Hashing Block Sources
It is known that if a 2-universal hash function H is applied to elements of a block source (X1, . . . , XT ), where each item Xi has enough min-entropy conditioned on the previous...
Kai-Min Chung, Salil P. Vadhan
ICDCSW
2005
IEEE
15 years 5 months ago
Defending against Sybil Attacks in Sensor Networks
Sybil attack is a harmful threat to sensor networks, in which a malicious node illegally forges an unbounded number of identities to defeat redundancy mechanisms. Digital certifi...
Qinghua Zhang, Pan Wang, Douglas S. Reeves, Peng N...