2924 search results - page 377 / 585 » Lower Bounds in Distributed Computing |
125
click to vote
DCC
2005
IEEE
16 years 4 months ago
2005
IEEE
Asymptotically optimal bit allocation among a set of quantizers for a finite collection of sources was determined in 1963 by Huang and Schultheiss. Their solution, however, gives ...
160
click to vote
SDM
2009
SIAM
16 years 2 months ago
2009
SIAM
Data stream analysis frequently relies on identifying correlations and posing conditional queries on the data after it has been seen. Correlated aggregates form an important examp...
120
Voted
STACS
2009
Springer
15 years 11 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...
144
click to vote
STACS
2009
Springer
15 years 11 months ago
2009
Springer
The paper investigates the power of the dynamic complexity classes DynFO, DynQF and DynPROP over string languages. The latter two classes contain problems that can be maintained us...
134
click to vote
CSE
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract—Extensive work has been devoted to private information retrieval and privacy preserving data mining. To protect user privacy from search engines, however, most current a...