Sciweavers

193 search results - page 22 / 39
» Approximate Maximum Parsimony and Ancestral Maximum Likeliho...
Sort
View
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
16 years 1 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy
96
Voted
EMMCVPR
2005
Springer
15 years 6 months ago
Exploiting Inference for Approximate Parameter Learning in Discriminative Fields: An Empirical Study
Abstract. Estimation of parameters of random field models from labeled training data is crucial for their good performance in many image analysis applications. In this paper, we p...
Sanjiv Kumar, Jonas August, Martial Hebert
112
Voted
ACL
2006
15 years 1 months ago
Approximation Lasso Methods for Language Modeling
Lasso is a regularization method for parameter estimation in linear models. It optimizes the model parameters with respect to a loss function subject to model complexities. This p...
Jianfeng Gao, Hisami Suzuki, Bin Yu
ICASSP
2011
IEEE
14 years 4 months ago
An approximate Minimum MOSPA estimator
Optimizing over a variant of the Mean Optimal Subpattern Assignment (MOSPA) metric is equivalent to optimizing over the track accuracy statistic often used in target tracking benc...
David Frederic Crouse, Peter Willett, Marco Guerri...
105
Voted
IOR
2008
104views more  IOR 2008»
15 years 14 days ago
Arrival Rate Approximation by Nonnegative Cubic Splines
Estimating the arrival rate function of a non-homogeneous Poisson process based on observed arrival data is a problem naturally arising in many applications. Cubic spline function...
Farid Alizadeh, Jonathan Eckstein, Nilay Noyan, G&...