1279 search results - page 145 / 256 » Approximation Algorithms for Min-Max Generalization Problems |
216
click to vote
EMMCVPR
2011
Springer
14 years 1 months ago
2011
Springer
In this work, we are concerned with the detection of multiple objects in an image. We demonstrate that typically applied objectives have the structure of a random field model, but...
LATIN
2010
Springer
15 years 7 months ago
2010
Springer
In this paper we design an iterative rounding approach for the classic prize-collecting Steiner forest problem and more generally the prize-collecting survivable Steiner network de...
120
click to vote
JMLR
2006
15 years 1 months ago
2006
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
151
click to vote
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
109
Voted
SECON
2008
IEEE
15 years 8 months ago
2008
IEEE
Abstract—In contrast to existing work on the connected coverage problem in wireless sensor networks which assumes omnidirectional sensors with disk-like sensing range, this paper...