Sciweavers

886 search results - page 31 / 178
» Adaptive sampling for quickselect
Sort
View
JMLR
2010
143views more  JMLR 2010»
13 years 2 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
STOC
2012
ACM
192views Algorithms» more  STOC 2012»
11 years 10 months ago
Nearly optimal sparse fourier transform
We consider the problem of computing the k-sparse approximation to the discrete Fourier transform of an ndimensional signal. We show: • An O(k log n)-time randomized algorithm f...
Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric ...
CVPR
2012
IEEE
11 years 10 months ago
Capturing relightable images using computer monitors
Image based relighting techniques are a popular choice for generating photo-realistic images of objects under any lighting condition. A typical process for creating such a model i...
Prabath Gunawardane, Steven Scher, James Davis
SIAMSC
2008
198views more  SIAMSC 2008»
13 years 7 months ago
Model Reduction for Large-Scale Systems with High-Dimensional Parametric Input Space
A model-constrained adaptive sampling methodology is proposed for reduction of large-scale systems with high-dimensional parametric input spaces. Our model reduction method uses a ...
T. Bui-Thanh, Karen Willcox, Omar Ghattas
TIP
2011
89views more  TIP 2011»
13 years 2 months ago
Random Phase Textures: Theory and Synthesis
This paper explores the mathematical and algorithmic properties of two sample-based microtexture models: random phase noise (RPN ) and asymptotic discrete spot noise (ADSN ). Thes...
Bruno Galerne, Yann Gousseau, Jean-Michel Morel