Sciweavers

955 search results - page 90 / 191
» Component-Based Adaptive Sampling
Sort
View
NIPS
2004
15 years 3 months ago
Analysis of a greedy active learning strategy
act out the core search problem of active learning schemes, to better understand the extent to which adaptive labeling can improve sample complexity. We give various upper and low...
Sanjoy Dasgupta
114
Voted
CORR
2010
Springer
125views Education» more  CORR 2010»
15 years 2 months ago
Near-Optimal Bayesian Active Learning with Noisy Observations
We tackle the fundamental problem of Bayesian active learning with noise, where we need to adaptively select from a number of expensive tests in order to identify an unknown hypot...
Daniel Golovin, Andreas Krause, Debajyoti Ray
JMLR
2010
143views more  JMLR 2010»
14 years 9 months ago
Rademacher Complexities and Bounding the Excess Risk in Active Learning
Sequential algorithms of active learning based on the estimation of the level sets of the empirical risk are discussed in the paper. Localized Rademacher complexities are used in ...
Vladimir Koltchinskii
110
Voted
ICIP
2000
IEEE
16 years 3 months ago
Hierarchical Representation and Coding of Surfaces Using 3D Polygon Meshes
This paper presents a novel procedure for the representation and coding of 3D surfaces using hierarchical adaptive triangulation. The proposed procedure is based on pyramidal anal...
Ioannis Kompatsiaris, Michael G. Strintzis
109
Voted
VLSID
2001
IEEE
129views VLSI» more  VLSID 2001»
16 years 2 months ago
Power-aware Multimedia Systems using Run-time Prediction
The need for low-power multimedia processing is integral to portable and embedded devices such as cell phones, wireless terminals, multimedia handhelds and PDAs. The multimedia pr...
Pavan Kumar, Mani B. Srivastava