138 search results - page 7 / 28 » Lower Bounds for Succinct Data Structures |
111
click to vote
ICPR
2010
IEEE
15 years 6 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
16 years 19 days 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
15 years 5 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.
136
click to vote
SPIRE
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Colored range queries are a well-studied topic in computational geometry and database research that, in the past decade, have found exciting applications in information r...
109
click to vote
ESCAPE
2007
Springer
15 years 5 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 ...