Sciweavers

677 search results - page 13 / 136
» On the reconstruction of perfect codes
Sort
View
JCT
2011
106views more  JCT 2011»
13 years 4 months ago
Bounds for separating hash families
This paper aims to present a new upper bound on the size of separating hash families. This bound improves previously known bounds for separating hash families of general type. Key...
Marjan Bazrafshan, Tran van Trung
ICIP
2004
IEEE
14 years 11 months ago
Distributed compression of the plenoptic function
In this paper, we consider the problem of distributed compression in camera sensor networks. Due to the spatial proximity of the different cameras, acquired images can be highly d...
Nicolas Gehrig, Pier Luigi Dragotti
ICPR
2008
IEEE
14 years 11 months ago
Securing fingerprint template: Fuzzy vault with minutiae descriptors
Fuzzy vault has been shown to be an effective technique for securing fingerprint minutiae templates. Its security depends on the difficulty in identifying the set of genuine minut...
Abhishek Nagar, Anil K. Jain, Karthik Nandakumar
WWW
2007
ACM
14 years 10 months ago
GigaHash: scalable minimal perfect hashing for billions of urls
A minimal perfect function maps a static set of keys on to the range of integers {0,1,2, ... , - 1}. We present a scalable high performance algorithm based on random graphs for ...
Kumar Chellapilla, Anton Mityagin, Denis Xavier Ch...
CIKM
2008
Springer
13 years 11 months ago
TinyLex: static n-gram index pruning with perfect recall
Inverted indexes using sequences of characters (n-grams) as terms provide an error-resilient and language-independent way to query for arbitrary substrings and perform approximate...
Derrick Coetzee