1871 search results - page 341 / 375 » The Ephemeral Pairing Problem |
WWW
2009
ACM
15 years 11 months ago
2009
ACM
We consider the problem of identifying the consensus ranking for the results of a query, given preferences among those results from a set of individual users. Once consensus ranki...
122
click to vote
WWW
2005
ACM
15 years 11 months ago
2005
ACM
Automatic extraction of semantic information from text and links in Web pages is key to improving the quality of search results. However, the assessment of automatic semantic meas...
94
Voted
STOC
2009
ACM
15 years 11 months ago
2009
ACM
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
106
click to vote
ESORICS
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Several generic constructions for transforming one-way functions to asymmetric encryption schemes have been proposed. One-way functions only guarantee the weak secrecy of...
117
Voted
KDD
2008
ACM
15 years 11 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...