879 search results - page 27 / 176 » Forecasting high-dimensional data |
153
click to vote
EDBT
2000
ACM
15 years 7 months ago
2000
ACM
In high-dimensional query processing, the optimization of the logical page-size of index structures is an important research issue. Even very simple query processing techniques suc...
103
click to vote
PR
2007
15 years 2 months ago
2007
Classical clustering algorithms are based on the concept that a cluster center is a single point. Clusters which are not compact around a single point are not candidates for class...
228
click to vote
ICDE
2002
IEEE
16 years 4 months ago
2002
IEEE
Nearest Neighbor search is an important and widely used problem in a number of important application domains. In many of these domains, the dimensionality of the data representati...
168
click to vote
VLDB
2000
ACM
15 years 6 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...
149
click to vote
WWW
2009
ACM
16 years 3 months ago
2009
ACM
Transferring knowledge from one domain to another is challenging due to a number of reasons. Since both conditional and marginal distribution of the training data and test data ar...