2498 search results - page 23 / 500 » Data Structures with Unpredictable Timing |
163
click to vote
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
We introduce the Haar+ tree: a refined, wavelet-inspired data structure for synopsis construction. The advantages of this structure are twofold: First, it achieves higher synopsis...
82
Voted
WABI
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Protein design software places amino acid side chains by precomputing rotamer-pair energies and optimizing rotamer placement. If the software optimizes by rapid stochasti...
69
Voted
ESA
2006
Springer
15 years 1 months ago
2006
Springer
We study the problem of designing kinetic data structures (KDS's for short) when event times cannot be computed exactly and events may be processed in a wrong order. In tradi...
ISAAC
2004
Springer
15 years 3 months ago
2004
Springer
The class of interval probe graphs is introduced to deal with the physical mapping and sequencing of DNA as a generalization of interval graphs. The polynomial time recognition al...
67
Voted
DCC
2010
IEEE
15 years 4 months ago
2010
IEEE
We propose new data structures for navigation in sequences of balanced parentheses, a standard tool for representing compressed trees. The most striking property of our approach is...