Sciweavers

683 search results - page 74 / 137
» Randomized Data Structures for the Dynamic Closest-Pair Prob...
Sort
View
CONSTRAINTS
2010
101views more  CONSTRAINTS 2010»
13 years 8 months ago
Evaluating the impact of AND/OR search on 0-1 integer linear programming
AND/OR search spaces accommodate advanced algorithmic schemes for graphical models which can exploit the structure of the model. We extend and evaluate the depth-first and best-fi...
Radu Marinescu 0002, Rina Dechter
SPAA
2009
ACM
14 years 8 months ago
Dynamic external hashing: the limit of buffering
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
Zhewei Wei, Ke Yi, Qin Zhang
BMCBI
2010
118views more  BMCBI 2010»
13 years 8 months ago
From learning taxonomies to phylogenetic learning: Integration of 16S rRNA gene data into FAME-based bacterial classification
Background: Machine learning techniques have shown to improve bacterial species classification based on fatty acid methyl ester (FAME) data. Nonetheless, FAME analysis has a limit...
Bram Slabbinck, Willem Waegeman, Peter Dawyndt, Pa...
DOCENG
2004
ACM
14 years 1 months ago
Querying XML documents by dynamic shredding
With the wide adoption of XML as a standard data representation and exchange format, querying XML documents becomes increasingly important. However, relational database systems co...
Hui Zhang 0003, Frank Wm. Tompa
FOCS
2007
IEEE
14 years 2 months ago
Strongly History-Independent Hashing with Applications
We present a strongly history independent (SHI) hash table that supports search in O(1) worst-case time, and insert and delete in O(1) expected time using O(n) data space. This ma...
Guy E. Blelloch, Daniel Golovin