2498 search results - page 33 / 500 » Data Structures with Unpredictable Timing |
157
click to vote
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
Applications that monitor functions over rapidly and unpredictably changing data, express their needs as continuous queries. Our focus is on a rich class of queries, expressed as p...
ICML
2008
IEEE
15 years 10 months ago
2008
IEEE
Structured models often achieve excellent performance but can be slow at test time. We investigate structure compilation, where we replace structure with features, which are often...
ESOP
2008
Springer
14 years 11 months ago
2008
Springer
A data structure is said to be persistent when any update operation returns a new structure without altering the old version. This paper introduces a new notion of persistence, cal...
SIGMETRICS
2003
ACM
15 years 2 months ago
2003
ACM
Caches have become increasingly important with the widening gap between main memory and processor speeds. However, they are a source of unpredictability due to their characteristi...
115
click to vote
ACSC
2007
IEEE
15 years 4 months ago
2007
IEEE
Tries are the fastest tree-based data structures for managing strings in-memory, but are space-intensive. The burst-trie is almost as fast but reduces space by collapsing trie-cha...