11211 search results - page 121 / 2243 » Rank-Sensitive Data Structures |
196
click to vote
WEA
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. The disjoint-set data structure is used to maintain a collection of non-overlapping sets of elements from a finite universe. Algorithms that operate on this data structu...
91
Voted
ESA
2007
Springer
15 years 7 months ago
2007
Springer
We consider the problem of ray shooting in a three-dimensional scene consisting of k (possibly intersecting) convex polyhedra with a total of n facets. That is, we want to preproc...
96
Voted
PODC
2003
ACM
15 years 6 months ago
2003
ACM
We propose a new form of software transactional memory (STM) designed to support dynamic-sized data structures, and we describe a novel non-blocking implementation. The non-blocki...
58
Voted
CORR
2007
Springer
15 years 23 days ago
2007
Springer
Motivated by an application in computational topology, we consider a novel variant of the problem of efficiently maintaining dynamic rooted trees. This variant allows an operation...
135
Voted
COCOON
1998
Springer
15 years 5 months ago
1998
Springer
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...