2040 search results - page 73 / 408 » Approximate Expectation Maximization |
GECCO
2007
Springer
15 years 5 months ago
2007
Springer
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
105
click to vote
BMVC
2010
14 years 9 months ago
2010
The paper proposes a new method to perform foreground detection by means of background modeling using the tensor concept. Sometimes, statistical modelling directly on image values...
100
click to vote
SODA
2000
ACM
15 years 25 days ago
2000
ACM
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
Motivated by applications in grid computing and projects management, we study multiprocessor scheduling in scenarios where there is uncertainty in the successful execution of jobs...
APPROX
2008
Springer
15 years 1 months ago
2008
Springer
We present the first 7/8-approximation algorithm for the maximum traveling salesman problem with triangle inequality. Our algorithm is deterministic. This improves over both the r...