Sciweavers

2040 search results - page 42 / 408
» Approximate Expectation Maximization
Sort
View
CORR
2010
Springer
94views Education» more  CORR 2010»
14 years 10 months ago
When LP is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
Nikhil Bansal, Anupam Gupta, Jian Li, Juliá...
JMLR
2011
125views more  JMLR 2011»
14 years 6 months ago
Approximate Marginals in Latent Gaussian Models
We consider the problem of improving the Gaussian approximate posterior marginals computed by expectation propagation and the Laplace method in latent Gaussian models and propose ...
Botond Cseke, Tom Heskes
BIRD
2008
Springer
162views Bioinformatics» more  BIRD 2008»
15 years 1 months ago
Suffix Tree Characterization of Maximal Motifs in Biological Sequences
Finding motifs in biological sequences is one of the most intriguing problems for string algorithms designers due to, on the one hand, the numerous applications of this problem in...
Maria Federico, Nadia Pisanti
SWAT
2004
Springer
103views Algorithms» more  SWAT 2004»
15 years 4 months ago
Maximizing the Area of Overlap of Two Unions of Disks Under Rigid Motion
Let A and B be two sets of n resp. m disjoint unit disks in the plane, with m ≥ n. We consider the problem of finding a translation or rigid motion of A that maximizes the tota...
Mark de Berg, Sergio Cabello, Panos Giannopoulos, ...
COCO
2006
Springer
96views Algorithms» more  COCO 2006»
15 years 3 months ago
Optimal Hardness Results for Maximizing Agreements with Monomials
We consider the problem of finding a monomial (or a term) that maximizes the agreement rate with a given set of examples over the Boolean hypercube. The problem is motivated by le...
Vitaly Feldman