Sciweavers

1236 search results - page 57 / 248
» Robust estimation for sparse data
Sort
View
ECCV
2004
Springer
15 years 11 months ago
A Robust Algorithm for Characterizing Anisotropic Local Structures
This paper proposes a robust estimation and validation framework for characterizing local structures in a positive multi-variate continuous function approximated by a Gaussian-base...
Kazunori Okada, Dorin Comaniciu, Navneet Dalal, Ar...
FOCS
2009
IEEE
15 years 4 months ago
Distance Oracles for Sparse Graphs
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
Christian Sommer 0002, Elad Verbin, Wei Yu
CVPR
2008
IEEE
15 years 12 months ago
Learning Bayesian Networks with qualitative constraints
Graphical models such as Bayesian Networks (BNs) are being increasingly applied to various computer vision problems. One bottleneck in using BN is that learning the BN model param...
Yan Tong, Qiang Ji
CORR
2011
Springer
202views Education» more  CORR 2011»
14 years 4 months ago
Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions
We analyze a class of estimators based on a convex relaxation for solving highdimensional matrix decomposition problems. The observations are the noisy realizations of the sum of ...
Alekh Agarwal, Sahand Negahban, Martin J. Wainwrig...
NECO
2002
100views more  NECO 2002»
14 years 9 months ago
Robust Regression with Asymmetric Heavy-Tail Noise Distributions
In the presence of a heavy-tail noise distribution, regression becomes much more di cult. Traditional robust regression methods assume that the noise distribution is symmetric and...
Ichiro Takeuchi, Yoshua Bengio, Takafumi Kanamori