683 search results - page 8 / 137 » Randomized Data Structures for the Dynamic Closest-Pair Prob... |
ISCIS
2005
Springer
14 years 1 months ago
2005
Springer
We introduce a novel data structure for solving the range query problem in generic metric spaces. It can be seen as a dynamic version of the List of Clusters data structure of Ch´...
COMPGEOM
2011
ACM
12 years 11 months ago
2011
ACM
We present three results related to dynamic convex hulls: • A fully dynamic data structure for maintaining a set of n points in the plane so that we can find the edges of the c...
WADS
2001
Springer
14 years 5 days ago
2001
Springer
Abstract. We develop succinct data structures to represent (i) a sequence of values to support partial sum and select queries and update (changing values) and (ii) a dynamic array ...
NIPS
2004
13 years 9 months ago
2004
In this paper, we explore the use of Random Forests (RFs) in the structured language model (SLM), which uses rich syntactic information in predicting the next word based on words ...
WADS
1997
Springer
13 years 12 months ago
1997
Springer
We present several efficient dynamic data structures for point-enclosure queries, involving convex fat objects in R2 or R3. Our planar structures are actually fitted for a more ...