Sciweavers

11212 search results - page 483 / 2243
» Semi-persistent Data Structures
Sort
View
IPL
2008
100views more  IPL 2008»
15 years 6 months ago
On the false-positive rate of Bloom filters
Bloom filters are a randomized data structure for membership queries dating back to 1970. Bloom filters sometimes give erroneous answers to queries, called false positives. Bloom a...
Prosenjit Bose, Hua Guo, Evangelos Kranakis, Anil ...
JSAT
2008
79views more  JSAT 2008»
15 years 6 months ago
PicoSAT Essentials
In this article we describe and evaluate optimized compact data structures for watching literals. Experiments with our SAT solver PicoSAT show that this low-level optimization not...
Armin Biere
NAR
2000
76views more  NAR 2000»
15 years 6 months ago
Update of KEYnet: a gene and protein names database for biosequences functional organisation
KEYnet is a database where gene and protein names are hierarchically structured. Particular care has been devoted to the search and organisation of synonyms. The structuring is ba...
Domenico Catalano, Flavio Licciulli, Domenica D'El...
IPL
2002
59views more  IPL 2002»
15 years 6 months ago
An efficient decoding technique for Huffman codes
We present a new data structure for Huffman coding in which in addition to sending symbols in order of their appearance in the Huffman tree one needs to send codes of all circular...
Rezaul Alam Chowdhury, M. Kaykobad, Irwin King
PPOPP
2012
ACM
14 years 2 months ago
Wait-free linked-lists
The linked-list data structure is fundamental and ubiquitous. Lockfree versions of the linked-list are well known. However, the existence of a practical wait-free linked-list has ...
Shahar Timnat, Anastasia Braginsky, Alex Kogan, Er...