860 search results - page 61 / 172 » Lower Bounds on the Size of Test Data Sets |
ICPR
2008
IEEE
14 years 2 months ago
2008
IEEE
For a finite set of points lying on a lower dimensional manifold embedded in a high-dimensional data space, algorithms have been developed to study the manifold structure. Howeve...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
Nearest neighbour classifiers and related kernel methods often perform poorly in high dimensional problems because it is infeasible to include enough training samples to cover the...
CSDA
2007
13 years 7 months ago
2007
A time series is said to Granger cause another series if it has incremental predictive power when forecasting it. While Granger causality tests have been studied extensively in th...
VLDB
2007
ACM
14 years 1 months ago
2007
ACM
Testing a database engine has been and continues to be a challenging task. The space of possible SQL queries along with their possible access paths is practically unbounded. Moreo...
JCST
2006
13 years 7 months ago
2006
This paper describes efficient data structures, namely the Indexed P-tree, Block P-tree, and Indexed-Block P-tree (or IP-tree, BP-tree, and IBP-tree, respectively, for short), for...