11211 search results - page 1796 / 2243 » Rank-Sensitive Data Structures |
138
Voted
COMPGEOM
2010
ACM
15 years 9 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
143
click to vote
HT
2010
ACM
15 years 9 months ago
2010
ACM
Collaborative tagging systems are popular tools for organization, sharing and retrieval of web resources. Their success is due to their freedom and simplicity of use. To post a re...
117
click to vote
MICRO
2002
IEEE
15 years 9 months ago
2002
IEEE
Data prefetching effectively reduces the negative effects of long load latencies on the performance of modern processors. Hardware prefetchers employ hardware structures to predic...
159
click to vote
ICPADS
1998
IEEE
15 years 9 months ago
1998
IEEE
We extend a torus-based coterie structure for distributed mutual exclusion to allow k multiple entries in a critical section. In the original coterie, the system nodes are logical...
152
click to vote
STOC
1996
ACM
15 years 9 months ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...