138 search results - page 8 / 28 » Bit-probe lower bounds for succinct data structures |
ICPR
2010
IEEE
14 years 2 months ago
2010
IEEE
We consider the problem of classification in nonadaptive dimensionality reduction. Specifically, we bound the increase in classification error of Fisher’s Linear Discriminant...
MICCAI
2006
Springer
14 years 8 months ago
2006
Springer
This work studies limits on estimating the width of thin tubular structures in 3D images. Based on nonlinear estimation theory we analyze the minimal stochastic error of estimating...
SAT
2005
Springer
14 years 1 months ago
2005
Springer
We present two new branch and bound weighted Max-SAT solvers (Lazy and Lazy ) which incorporate original data structures and inference rules, and a lower bound of better quality.
ESCAPE
2007
Springer
14 years 2 months ago
2007
Springer
We present deterministic sub-linear space algorithms for a number of problems over update data streams, including, estimating frequencies of items and ranges, finding approximate ...
FOCS
2000
IEEE
14 years 9 days ago
2000
IEEE
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...