184 search results - page 31 / 37 » Query Complexity Lower Bounds for Reconstruction of Codes |
GRAPHICSINTERFACE
2007
13 years 9 months ago
2007
Modeling 3D objects and scenes is an important part of computer graphics. One approach to modeling is projecting binary patterns onto the scene in order to obtain correspondences ...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
The classical problem of reliable point-to-point digital communication is to achieve a low probability of error while keeping the rate high and the total power consumption small. ...
STACS
2007
Springer
14 years 1 months ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
JVCIR
2006
13 years 7 months ago
2006
In this paper, we propose a family of novel stereoscopic image coders based on morphological coding and a block-based disparity compensation algorithm. The proposed schemes employ...
STACS
2009
Springer
14 years 2 months ago
2009
Springer
We study data structures in the presence of adversarial noise. We want to encode a given object in a succinct data structure that enables us to efficiently answer specific queries...