3360 search results - page 52 / 672 » Opportunistic Data Structures with Applications |
109
click to vote
ALENEX
2003
15 years 4 months ago
2003
We present a data structure, called a ray interpolant tree, or RI-tree, which stores a discrete set of directed lines in 3-space, each represented as a point in 4-space. Each dire...
144
click to vote
VLDB
2004
ACM
15 years 8 months ago
2004
ACM
At a fundamental level, the key challenge in data integration is to reconcile the semantics of disparate data sets, each expressed with a different database structure. I argue th...
116
click to vote
SODA
2004
ACM
15 years 4 months ago
2004
ACM
In this paper we study the problem of designing concurrent searchable data structures with performance guarantees that can be used in a distributed environment where data elements...
120
click to vote
ICNP
2007
IEEE
15 years 9 months ago
2007
IEEE
—Data structures representing directed graphs with edges labeled by symbols from a finite alphabet are used to implement packet processing algorithms used in a variety of network...
133
click to vote
ACMMSP
2005
ACM
15 years 8 months ago
2005
ACM
64-bit address spaces are increasingly important for modern applications, but they come at a price: pointers use twice as much memory, reducing the effective cache capacity and m...