11211 search results - page 261 / 2243 » Rank-Sensitive Data Structures |
141
click to vote
ICPR
2002
IEEE
15 years 11 months ago
2002
IEEE
We consider clustering as computation of a structure of proximity relationships within a data set in a feature space or its subspaces. We propose a data structure to represent suc...
151
click to vote
SIAMCOMP
1998
15 years 6 months 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...
162
click to vote
CSDA
2008
15 years 6 months ago
2008
Multivariate kernel density estimation provides information about structure in data. Feature significance is a technique for deciding whether features
151
click to vote
PVLDB
2010
15 years 4 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...
214
click to vote
SPIRE
2010
Springer
15 years 4 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...