184 search results - page 30 / 37 » Query Complexity Lower Bounds for Reconstruction of Codes |
DAGSTUHL
2006
13 years 9 months ago
2006
This paper presents the optimal compression for sequences with undefined values. Let we have (N -m) undefined and m defined positions in the boolean sequence V of length N. The se...
VLDB
2007
ACM
14 years 1 months ago
2007
ACM
Testing a database engine has been and continues to be a challenging task. The space of possible SQL queries along with their possible access paths is practically unbounded. Moreo...
INFOCOM
2012
IEEE
11 years 10 months ago
2012
IEEE
—Counting Bloom Filters (CBFs) are widely used in networking device algorithms. They implement fast set representations to support membership queries with limited error, and supp...
ESA
2004
Springer
14 years 1 months ago
2004
Springer
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...
CORR
2002
Springer
13 years 7 months ago
2002
Springer
We examine a computational geometric problem concerning the structure of polymers. We model a polymer as a polygonal chain in three dimensions. Each edge splits the polymer into t...