153 search results - page 15 / 31 » Computing Approximate Solutions of the Maximum Covering Prob... |
APPROX
2004
Springer
14 years 29 days ago
2004
Springer
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
ICML
2009
IEEE
14 years 8 months ago
2009
IEEE
The general stochastic optimal control (SOC) problem in robotics scenarios is often too complex to be solved exactly and in near real time. A classical approximate solution is to ...
FOCS
2008
IEEE
13 years 8 months ago
2008
IEEE
In the mobile facility location problem, which is a variant of the classical Uncapacitated Facility Location and kMedian problems, each facility and client is assigned to a start ...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
Many problems in computer vision can be modeled using
conditional Markov random fields (CRF). Since finding
the maximum a posteriori (MAP) solution in such models
is NP-hard, mu...
Lecture Notes
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...