Sciweavers

2040 search results - page 81 / 408
» Approximate Expectation Maximization
Sort
View
COMPGEOM
2000
ACM
15 years 3 months ago
When crossings count - approximating the minimum spanning tree
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
Sariel Har-Peled, Piotr Indyk
SMI
2003
IEEE
142views Image Analysis» more  SMI 2003»
15 years 4 months ago
Approximate Congruence Detection of Model Features for Reverse Engineering
Reverse engineering allows the geometric reconstruction of simple mechanical parts. However, the resulting models suffer from inaccuracies caused by errors in measurement and reco...
C. H. Gao, Frank C. Langbein, A. David Marshall, R...
SODA
2008
ACM
122views Algorithms» more  SODA 2008»
15 years 29 days ago
Fast approximation of the permanent for very dense problems
Approximation of the permanent of a matrix with nonnegative entries is a well studied problem. The most successful approach to date for general matrices uses Markov chains to appr...
Mark Huber, Jenny Law
SIAMJO
2002
124views more  SIAMJO 2002»
14 years 11 months ago
The Sample Average Approximation Method for Stochastic Discrete Optimization
In this paper we study a Monte Carlo simulation based approach to stochastic discrete optimization problems. The basic idea of such methods is that a random sample is generated and...
Anton J. Kleywegt, Alexander Shapiro, Tito Homem-d...
JMLR
2011
106views more  JMLR 2011»
14 years 6 months ago
A Bayesian Approximation Method for Online Ranking
This paper describes a Bayesian approximation method to obtain online ranking algorithms for games with multiple teams and multiple players. Recently for Internet games large onli...
Ruby C. Weng, Chih-Jen Lin