2635 search results - page 189 / 527 » Algorithms for the Database Layout Problem |
223
click to vote
VLDB
2000
ACM
15 years 10 months ago
2000
ACM
Nearest neighbor search in high dimensional spaces is an interesting and important problem which is relevant for a wide variety of novel database applications. As recent results s...
167
click to vote
KDD
2004
ACM
16 years 7 months ago
2004
ACM
Dimension reduction is a critical data preprocessing step for many database and data mining applications, such as efficient storage and retrieval of high-dimensional data. In the ...
199
click to vote
IJCAI
1989
15 years 7 months ago
1989
Several published reports show that instancebased learning algorithms yield high classification accuracies and have low storage requirements during supervised learning application...
170
click to vote
DKE
2008
15 years 6 months ago
2008
Processing and extracting meaningful knowledge from count data is an important problem in data mining. The volume of data is increasing dramatically as the data is generated by da...
203
click to vote
CIKM
2007
Springer
15 years 10 months ago
2007
Springer
We investigate the problem of how to evaluate, fast and efficiently, classes of optimal route queries on a massive graph in a unified framework. To evaluate a route query effectiv...