207 search results - page 1 / 42 » Data Structures for Storing Small Sets in the Bitprobe Model |
ESA
2010
Springer
13 years 5 months ago
2010
Springer
abstract appeared in Proc. 24th Annual Symposium of Computational Geometry (SoCG), 2008, pp. 338-345. S. Shannigrahi and S. P. Pal, "Efficient Prufer-like Coding and Counting ...
CORR
2011
Springer
12 years 8 months ago
2011
Springer
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
STACS
2010
Springer
13 years 11 months ago
2010
Springer
We construct efficient data structures that are resilient against a constant fraction of adversarial noise. Our model requires that the decoder answers most queries correctly with...
EMNLP
2010
13 years 2 months ago
2010
We present three novel methods of compactly storing very large n-gram language models. These methods use substantially less space than all known approaches and allow n-gram probab...
DASFAA
2010
IEEE
13 years 9 months ago
2010
IEEE
Efficient management of RDF data is an important factor in realizing the Semantic Web vision. The existing approaches store RDF data based on triples instead of a relation model. I...