3360 search results - page 271 / 672 » Opportunistic Data Structures with Applications |
126
click to vote
SIGGRAPH
2010
ACM
15 years 9 months ago
2010
ACM
Collision detection is a problem that has often been addressed efficiently with the use of hierarchical culling data structures. In the subproblem of self-collision detection for ...
127
click to vote
ESA
2010
Springer
15 years 6 months ago
2010
Springer
The inability to answer proximity queries efficiently for spaces of dimension d > 2 has led to the study of approximation to proximity problems. Several techniques have been pro...
178
click to vote
SPIRE
2010
Springer
15 years 3 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...
186
click to vote
CORR
2010
Springer
14 years 11 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 ...
130
click to vote
ICWE
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. The massive amount of textual data on the Web raises numerous classification problems. Although the notion of domain is widely acknowledged in the IR field, the applica...