Sciweavers

780 search results - page 32 / 156
» Robustness and Randomness
Sort
View
CORR
2010
Springer
103views Education» more  CORR 2010»
13 years 9 months ago
Robust Matrix Decomposition with Outliers
Suppose a given observation matrix can be decomposed as the sum of a low-rank matrix and a sparse matrix (outliers), and the goal is to recover these individual components from th...
Daniel Hsu, Sham M. Kakade, Tong Zhang
TAL
2010
Springer
13 years 7 months ago
Robust Semi-supervised and Ensemble-Based Methods in Word Sense Disambiguation
Mihalcea [1] discusses self-training and co-training in the context of word sense disambiguation and shows that parameter optimization on individual words was important to obtain g...
Anders Søgaard, Anders Johannsen
ICCV
2009
IEEE
13 years 6 months ago
Consensus set maximization with guaranteed global optimality for robust geometry estimation
Finding the largest consensus set is one of the key ideas used by the original RANSAC for removing outliers in robust-estimation. However, because of its random and non-determinis...
Hongdong Li
ICIP
2004
IEEE
14 years 10 months ago
Decomposition of range images using markov random fields
This paper describes a computational model for deriving a decomposition of objects from laser rangefinder data. The process aims to produce a set of parts defined by compactness a...
Andreas Pichler, Robert B. Fisher, Markus Vincze
SIAMJO
2008
99views more  SIAMJO 2008»
13 years 8 months ago
The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs
Many optimization problems are naturally delivered in an uncertain framework, and one would like to exercise prudence against the uncertainty elements present in the problem. In pr...
Marco C. Campi, Simone Garatti