2040 search results - page 37 / 408 » Approximate Expectation Maximization |
141
Voted
APPROX
2009
Springer
15 years 9 months ago
2009
Springer
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...
106
Voted
COCOON
2005
Springer
15 years 8 months ago
2005
Springer
We study the worst-case performance of the maximal matching heuristic applied to the Minimum Vertex Cover and Minimum Maximal Matching problems, through a careful analysis of tigh...
SODA
2010
ACM
15 years 12 months ago
2010
ACM
Many commonly-used auction mechanisms are "maximal-in-range". We show that any maximalin-range mechanism for n bidders and m items cannot both approximate the social wel...
120
Voted
SWAT
2004
Springer
15 years 8 months ago
2004
Springer
Given a set of rectangles we are asked to pack as many of them as possible into a bigger rectangle. The rectangles packed may not overlap and may not be rotated. This problem is NP...
98
Voted
NIPS
2003
15 years 3 months ago
2003
The maximisation of information transmission over noisy channels is a common, albeit generally computationally difficult problem. We approach the difficulty of computing the mutua...