4843 search results - page 418 / 969 » The Shortcut Problem - Complexity and Approximation |
137
click to vote
ISAAC
2009
Springer
15 years 11 months ago
2009
Springer
Given m unit disks and n points in the plane, the discrete unit disk cover problem is to select a minimum subset of the disks to cover the points. This problem is NP-hard [11] and ...
144
Voted
ICARCV
2006
IEEE
15 years 11 months ago
2006
IEEE
— Many problems in computer vision such as pose recovery and structure estimation are formulated as a minimization process. These problems vary in the use of image measurements d...
142
click to vote
IPPS
2005
IEEE
15 years 10 months ago
2005
IEEE
We investigate the problem of maximizing the lifetime of wireless ad hoc and sensor networks. Being battery powered, nodes in such networks have to perform their intended task und...
155
click to vote
ALENEX
2008
15 years 6 months ago
2008
Consensus clustering is the problem of reconciling clustering information about the same data set coming from different sources or from different runs of the same algorithm. Cast ...
144
click to vote
DAM
2007
15 years 4 months ago
2007
In the partially-ordered knapsack problem (POK) we are given a set N of items and a partial order ≺P on N. Each item has a size and an associated weight. The objective is to pac...