195 search results - page 5 / 39 » Perfect Byte-Correcting Codes |
IPPS
1996
IEEE
13 years 11 months ago
1996
IEEE
This paper investigates methods to locate system resources, such as expensive hardware or software modules, to provide the most effective cost / performance tradeoffs in a torus p...
JCT
2011
13 years 2 months ago
2011
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...
WWW
2007
ACM
14 years 7 months ago
2007
ACM
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 ...
CIKM
2008
Springer
13 years 9 months ago
2008
Springer
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...
ARSCOM
2008
13 years 5 months ago
2008
A total perfect code in a graph is a subset of the graph's vertices with the property that each vertex in the graph is adjacent to exactly one vertex in the subset. We prove t...