111 search results - page 16 / 23 » Randomized computations on large data sets: tight lower boun... |
CSFW
1996
IEEE
13 years 11 months ago
1996
IEEE
: This paper examines some of the theoretical foundations of the distributable change detection method introduced by Forrest et al. in [10], including fundamental bounds on some of...
ALT
2004
Springer
14 years 4 months ago
2004
Springer
Kernel functions are typically viewed as providing an implicit mapping of points into a high-dimensional space, with the ability to gain much of the power of that space without inc...
PVLDB
2010
13 years 5 months ago
2010
We consider the problem of efficiently finding the top-k answers for join queries over web-accessible databases. Classical algorithms for finding top-k answers use branch-and-b...
ASPDAC
2006
ACM
14 years 1 months ago
2006
ACM
Abstract— Many of today’s data-intensive applications manipulate disk-resident data sets. As a result, their overall behavior is tightly coupled with their disk performance. Un...
ICPR
2010
IEEE
13 years 5 months ago
2010
IEEE
We report performance evaluation of our automatic feature discovery method on the publicly available Gisette dataset: a set of 29 features discovered by our method ranks 129 among...