184 search results - page 2 / 37 » Query Complexity Lower Bounds for Reconstruction of Codes |
ALT
1998
Springer
13 years 10 months ago
1998
Springer
Exact learning of half-spaces over finite subsets of IRn from membership queries is considered. We describe the minimum set of labelled examples separating the target concept from ...
APPROX
2010
Springer
13 years 7 months ago
2010
Springer
COMPGEOM
2006
ACM
13 years 11 months ago
2006
ACM
We investigate a new class of geometric problems based on the idea of online error correction. Suppose one is given access to a large geometric dataset though a query mechanism; f...
ICALP
2005
Springer
13 years 11 months ago
2005
Springer
We prove new lower bounds for locally decodable codes and private information retrieval. We show that a 2-query LDC encoding nbit strings over an ℓ-bit alphabet, where the decode...
ICALP
1992
Springer
13 years 9 months ago
1992
Springer
Abstract Bernard Chazelle Department of Computer Science Princeton University Burton Rosenberg Department of Mathematics and Computer Science Dartmouth College We give a lower bou...