5169 search results - page 454 / 1034 » Locality approximation using time |
189
click to vote
ICCS
2003
Springer
16 years 27 days ago
2003
Springer
Sparse Grids are the basis for efficient high dimensional approximation and have recently been applied successfully to predictive modelling. They are spanned by a collection of si...
217
click to vote
EUROCOLT
1999
Springer
15 years 12 months ago
1999
Springer
Abstract. Recent works have shown the advantage of using Active Learning methods, such as the Query by Committee (QBC) algorithm, to various learning problems. This class of Algori...
228
click to vote
IAT
2009
IEEE
16 years 2 months ago
2009
IEEE
In building practical sensor networks, it is often beneficial to use only a subset of sensors to take measurements because of computational, communication, and power limitations....
219
click to vote
ICML
2008
IEEE
16 years 8 months ago
2008
IEEE
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
222
click to vote
DATE
2007
IEEE
16 years 2 months ago
2007
IEEE
In data dominated applications, loop transformations have a huge impact on the lifetime of array data and therefore on memory footprint. Since a locally optimal loop transformatio...