11212 search results - page 1995 / 2243 » Semi-persistent Data Structures |
174
Voted
PODC
2004
ACM
15 years 9 months ago
2004
ACM
We present a low-cost, decentralized algorithm for ID management in distributed hash tables (DHTs) managed by a dynamic set of hosts. Each host is assigned an ID in the unit inter...
133
Voted
SIGCSE
2004
ACM
15 years 9 months ago
2004
ACM
Finding just the right example to answer a question can be difficult for CS1 students and teachers. For this to work well there must be an intuitive interface coupled to an approp...
132
click to vote
UIST
2004
ACM
15 years 9 months ago
2004
ACM
We present Citrine, a system that extends the widespread copy-and-paste interaction technique with intelligent transformations, making it useful in more situations. Citrine uses t...
115
click to vote
VLDB
2004
ACM
15 years 9 months ago
2004
ACM
In a binary symmetric relationship, A is related to B if and only if B is related to A. Symmetric relationships between k participating entities can be represented as multisets of...
134
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...