227 search results - page 27 / 46 » Dimensionality Reduction for Similarity Searching in Dynamic... |
145
click to vote
SIGMOD
2012
ACM
13 years 4 months ago
2012
ACM
Locality-Sensitive Hashing (LSH) and its variants are wellknown methods for solving the c-approximate NN Search problem in high-dimensional space. Traditionally, several LSH funct...
113
Voted
DASFAA
2007
IEEE
15 years 3 months ago
2007
IEEE
As data of an unprecedented scale are becoming accessible, skyline queries have been actively studied lately, to retrieve “interesting” data objects that are not dominated by a...
110
click to vote
SIGMOD
2002
ACM
16 years 2 months ago
2002
ACM
Time-parameterized queries (TP queries for short) retrieve (i) the actual result at the time that the query is issued, (ii) the validity period of the result given the current mot...
133
Voted
ICVGIP
2004
15 years 3 months ago
2004
Searching in scanned documents is an important problem in Digital Libraries. If OCRs are not available, the scanned images are inaccessible. In this paper, we demonstrate a search...
117
click to vote
WWW
2003
ACM
16 years 2 months ago
2003
ACM
The presence of replicas or near-replicas of documents is very common on the Web. Documents may be replicated completely or partially for different reasons (versions, mirrors, etc...