138 search results - page 15 / 28 » Lower Bounds for Succinct Data Structures |
136
Voted
SODA
2012
ACM
13 years 6 months ago
2012
ACM
We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...
139
Voted
IPMI
2005
Springer
15 years 9 months ago
2005
Springer
This work analyses the accuracy of estimating the location of 3D landmarks and characteristic image structures. Based on nonlinear estimation theory we study the minimal stochastic...
166
Voted
ECCC
2011
14 years 10 months ago
2011
Locally decodable codes are error correcting codes with the extra property that, in order to retrieve the correct value of just one position of the input with high probability, it...
127
Voted
ICDE
2010
IEEE
15 years 8 months ago
2010
IEEE
-- Publishing person specific data while protecting privacy is an important problem. Existing algorithms that enforce the privacy principle called l-diversity are heuristic based d...
154
Voted
STOC
2001
ACM
16 years 4 months ago
2001
ACM
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...