232 search results - page 39 / 47 » Fast High-Dimensional Data Search in Incomplete Databases |
82
Voted
ICDE
2008
IEEE
15 years 6 months ago
2008
IEEE
— Similarity joins have attracted significant interest, with applications in Geographical Information Systems, astronomy, marketing analyzes, and anomaly detection. However, all...
100
Voted
AAAI
2012
13 years 2 months ago
2012
Hashing, which tries to learn similarity-preserving binary codes for data representation, has been widely used for efficient nearest neighbor search in massive databases due to i...
91
Voted
COCO
2003
Springer
15 years 4 months ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
KDD
2009
ACM
16 years 6 days ago
2009
ACM
Most of recommender systems try to find items that are most relevant to the older choices of a given user. Here we focus on the "surprise me" query: A user may be bored ...
104
click to vote
BMCBI
2008
14 years 11 months ago
2008
Background: On-line biodiversity information databases are growing quickly and being integrated into general bioinformatics systems due to the advances of fast gene sequencing tec...