4541 search results - page 274 / 909 » Cache-Oblivious Algorithms and Data Structures |
211
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 ...
184
click to vote
SWAT
2004
Springer
15 years 12 months 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 ...
313
click to vote
ICDE
2009
IEEE
16 years 8 months ago
2009
IEEE
Keyword queries enjoy widespread usage as they represent an intuitive way of specifying information needs. Recently, answering keyword queries on graph-structured data has emerged ...
195
click to vote
CVPR
2004
IEEE
16 years 8 months ago
2004
IEEE
Can we detect low dimensional structure in high dimensional data sets of images? In this paper, we propose an algorithm for unsupervised learning of image manifolds by semidefinit...