11211 search results - page 1795 / 2243 » Rank-Sensitive Data Structures |
188
Voted
MM
2004
ACM
15 years 10 months ago
2004
ACM
We consider the problem of learning a mapping function from low-level feature space to high-level semantic space. Under the assumption that the data lie on a submanifold embedded ...
179
click to vote
PODC
2004
ACM
15 years 10 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...
135
click to vote
SIGCSE
2004
ACM
15 years 10 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...
137
click to vote
UIST
2004
ACM
15 years 10 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...
118
click to vote
VLDB
2004
ACM
15 years 10 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...