4536 search results - page 287 / 908 » Contention-Sensitive Data Structures and Algorithms |
208
click to vote
IUI
2011
ACM
14 years 9 months ago
2011
ACM
As people accumulate hundreds of “friends” in social media, a flat list of connections becomes unmanageable. Interfaces agnostic to social structure hinder the nuanced sharin...
209
click to vote
APVIS
2011
2011
Loose capacity-constrained representatives for the qualitative visual analysis in molecular dynamics
14 years 6 months ago
Molecular dynamics is a widely used simulation technique to investigate material properties and structural changes under external forces. The availability of more powerful cluster...
215
click to vote
CONCUR
2012
Springer
13 years 9 months ago
2012
Springer
Abstract. Linearizability is a commonly accepted notion of correctness for libraries of concurrent algorithms. Unfortunately, it assumes a complete isolation between a library and ...
187
click to vote
SWAT
2004
Springer
16 years 1 days ago
2004
Springer
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
150
click to vote
SIGGRAPH
2010
ACM
15 years 10 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 ...