184 search results - page 5 / 37 » Query Complexity Lower Bounds for Reconstruction of Codes |
COCO
2003
Springer
14 years 1 months ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
COMPGEOM
2010
ACM
14 years 28 days ago
2010
ACM
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
PODS
2009
ACM
14 years 8 months ago
2009
ACM
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...
FOCS
2002
IEEE
14 years 24 days ago
2002
IEEE
We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....
FCT
2005
Springer
14 years 1 months ago
2005
Springer
We review a recently introduced computation model for streaming and external memory data. An important feature of this model is that it distinguishes between sequentially reading (...