Sciweavers

455 search results - page 46 / 91
» Adaptive Sampling for Noisy Problems
Sort
View
AAAI
1998
13 years 9 months ago
Branch and Bound Algorithm Selection by Performance Prediction
Wepropose a method called Selection by Performance Prediction (SPP) which allows one, when faced with a particular problem instance, to select a Branch and Boundalgorithm from amo...
Lionel Lobjois, Michel Lemaître
ICCV
2005
IEEE
14 years 9 months ago
An Ensemble Prior of Image Structure for Cross-Modal Inference
In cross-modal inference, we estimate complete fields from noisy and missing observations of one sensory modality using structure found in another sensory modality. This inference...
S. Ravela, Antonio B. Torralba, William T. Freeman
SYNTHESE
2008
84views more  SYNTHESE 2008»
13 years 7 months ago
How experimental algorithmics can benefit from Mayo's extensions to Neyman-Pearson theory of testing
Although theoretical results for several algorithms in many application domains were presented during the last decades, not all algorithms can be analyzed fully theoretically. Exp...
Thomas Bartz-Beielstein
CVPR
2012
IEEE
11 years 10 months ago
Probabilistic tensor voting for robust perceptual grouping
We address the problem of unsupervised segmentation and grouping in 2D and 3D space, where samples are corrupted by noise, and in the presence of outliers. The problem has attract...
Dian Gong, Gérard G. Medioni
ICCV
2009
IEEE
15 years 18 days ago
Automatic annotation of human actions in video
This paper addresses the problem of automatic temporal annotation of realistic human actions in video using mini- mal manual supervision. To this end we consider two asso- ciate...
Olivier Duchenne, Ivan Laptev, Josef Sivic, Franci...