Sciweavers

89 search results - page 5 / 18
» An approximate Minimum MOSPA estimator
Sort
View
SODA
2008
ACM
184views Algorithms» more  SODA 2008»
13 years 10 months ago
Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
The problem of maximizing a concave function f(x) in a simplex S can be solved approximately by a simple greedy algorithm. For given k, the algorithm can find a point x(k) on a k-...
Kenneth L. Clarkson
TSP
2008
115views more  TSP 2008»
13 years 7 months ago
The Estimation of Laplace Random Vectors in Additive White Gaussian Noise
This paper develops and compares the maximum a posteriori (MAP) and minimum mean-square error (MMSE) estimators for spherically contoured multivariate Laplace random vectors in add...
Ivan W. Selesnick
ICASSP
2010
IEEE
13 years 8 months ago
Large margin estimation of n-gram language models for speech recognition via linear programming
We present a novel discriminative training algorithm for n-gram language models for use in large vocabulary continuous speech recognition. The algorithm uses large margin estimati...
Vladimir Magdin, Hui Jiang
CORR
2011
Springer
153views Education» more  CORR 2011»
13 years 3 months ago
Partially Linear Bayesian Estimation with Application to Sparse Approximations
—We address the problem of estimating a random vector X from two sets of measurements Y and Z, such that the estimator is linear in Y . We show that the partially linear minimum ...
Tomer Michaeli, Daniel Sigalov, Yonina C. Eldar
COMPGEOM
2004
ACM
14 years 2 months ago
On the least median square problem
We consider the exact and approximate computational complexity of the multivariate LMS linear regression estimator. The LMS estimator is among the most widely used robust linear s...
Jeff Erickson, Sariel Har-Peled, David M. Mount