3208 search results - page 74 / 642 » A Lower Bound for Primality |
COMPGEOM
2006
ACM
14 years 4 months ago
2006
ACM
Given a metric space (X, dX), c ≥ 1, r > 0, and p, q ∈ [0, 1], a distribution over mappings H : X → N is called a (r, cr, p, q)-sensitive hash family if any two points in...
PODC
2006
ACM
14 years 4 months ago
2006
ACM
IWSOC
2005
IEEE
14 years 3 months ago
2005
IEEE
SPAA
2005
ACM
14 years 3 months ago
2005
ACM
APPROX
2005
Springer
14 years 3 months ago
2005
Springer
A q-ary error-correcting code C ⊆ {1, 2, . . . , q}n is said to be list decodable to radius ρ with list size L if every Hamming ball of radius ρ contains at most L codewords o...