2635 search results - page 139 / 527 » Algorithms for the Database Layout Problem |
211
click to vote
EDBT
2012
ACM
13 years 8 months ago
2012
ACM
Increased availability of large repositories of chemical compounds has created new challenges and opportunities for the application of data-mining and indexing techniques to probl...
180
click to vote
SSD
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. This paper addresses the problem of finding k nearest neighbors for moving query point (we call it k-NNMP). It is an important issue in both mobile computing research an...
156
Voted
CLEANDB
2006
ACM
15 years 10 months ago
2006
ACM
We consider the Entity Resolution (ER) problem (also known as deduplication, or merge-purge), in which records determined to represent the same real-world entity are successively ...
180
click to vote
CIKM
2009
Springer
16 years 22 days ago
2009
Springer
Traditional boosting algorithms for the ranking problems usually employ the pairwise approach and convert the document rating preference into a binary-value label, like RankBoost....
112
click to vote
KDD
1997
ACM
15 years 10 months ago
1997
ACM
We presenthere an approachand algorithm for mining generalizedterm associations.The problem is to find co-occurrencefrequenciesof terms, given a collection of documents eachwith r...