11214 search results - page 104 / 2243 » Just-in-time data structures |
123
Voted
PODC
2003
ACM
15 years 9 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...
79
Voted
CORR
2007
Springer
15 years 3 months 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...
166
click to vote
COCOON
1998
Springer
15 years 8 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...
162
Voted
IEEEPACT
2009
IEEE
15 years 1 months ago
2009
IEEE
As the gap between processor and memory continues to grow, memory performance becomes a key performance bottleneck for many applications. Compilers therefore increasingly seek to m...
101
Voted
ICCV
1999
IEEE
16 years 5 months ago
1999
IEEE
