1184 search results - page 197 / 237 » Nearness relations and topology |
KDD
2008
ACM
14 years 9 months ago
2008
ACM
: Locality Sensitive Hash functions are invaluable tools for approximate near neighbor problems in high dimensional spaces. In this work, we are focused on LSH schemes where the si...
KDD
2008
ACM
14 years 9 months ago
2008
ACM
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
CHI
2007
ACM
14 years 9 months ago
2007
ACM
Web search engines present search results in a rank ordered list. This works when what a user wants is near the top, but sometimes the information that the user really wants is lo...
CHI
2002
ACM
14 years 9 months ago
2002
ACM
This two-day workshop examines the ways that on-line communities create and refine their shared resources, including both the formal and observable artifacts (documents, chats, th...
ICALP
2009
Springer
14 years 9 months ago
2009
Springer
The central goal of data stream algorithms is to process massive streams of data using sublinear storage space. Motivated by work in the database community on outsourcing database...