3415 search results - page 75 / 683 » Lower Bounds for Kernelizations |
129
click to vote
COMPGEOM
2006
ACM
15 years 10 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...
IWSOC
2005
IEEE
15 years 9 months ago
2005
IEEE
119
click to vote
APPROX
2005
Springer
15 years 9 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...