11213 search results - page 122 / 2243 » Low-contention data structures |
119
click to vote
ICCS
2007
Springer
15 years 7 months ago
2007
Springer
We present a case study to demonstrate the possibility of discovering complex and interesting latent structures using hierarchical latent class (HLC) models. A similar effort was m...
125
click to vote
ESA
2006
Springer
15 years 7 months ago
2006
Springer
We study the problem of designing kinetic data structures (KDS's for short) when event times cannot be computed exactly and events may be processed in a wrong order. In tradi...
237
click to vote
WEA
2010
Springer
15 years 10 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...
118
click to vote
ESA
2007
Springer
15 years 10 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...
122
click to vote
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...