11214 search results - page 231 / 2243 » Just-in-time data structures |
89
Voted
SIAMCOMP
1998
15 years 12 days ago
1998
We consider the problem of maintaining a dynamic planar graph subject to edge insertions and edge deletions that preserve planarity but that can change the embedding. We describe a...
105
Voted
CSDA
2008
15 years 9 days ago
2008
Multivariate kernel density estimation provides information about structure in data. Feature significance is a technique for deciding whether features
PVLDB
2010
14 years 11 months ago
2010
In XML search systems twig queries specify predicates on node values and on the structural relationships between nodes, and a key operation is to join individual query node matche...
133
click to vote
SPIRE
2010
Springer
14 years 11 months ago
2010
Springer
The rank and select operations over a string of length n from an alphabet of size σ have been used widely in the design of succinct data structures. In many applications, the stri...
147
Voted
CORR
2010
Springer
14 years 7 months ago
2010
Springer
In this paper we describe a new efficient (in fact optimal) data structure for the top-K color problem. Each element of an array A is assigned a color c with priority p(c). For a ...