1576 search results - page 144 / 316 » Properties of Synthetic Optimization Problems |
133
click to vote
WADS
2005
Springer
15 years 10 months ago
2005
Springer
We study the shortest path problem in weighted polygonal subdivisions of the plane, with the additional constraint of an upper bound, k, on the number of links (segments) in the pa...
140
click to vote
INFOCOM
2012
IEEE
13 years 7 months ago
2012
IEEE
—Conserving network-wide energy consumption is becoming an increasingly important concern for network operators. In this work, we study network-wide energy conservation problem w...
131
click to vote
SODA
2004
ACM
15 years 5 months ago
2004
ACM
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
284
click to vote
CVPR
2009
IEEE
16 years 11 months ago
2009
IEEE
Markov random field (MRF, CRF) models are popular in
computer vision. However, in order to be computationally
tractable they are limited to incorporate only local interactions
a...
142
click to vote
CVPR
2003
IEEE
16 years 6 months ago
2003
IEEE
This paper deals with simultaneous depth map estimation and background separation in a multi-view setting with several fixed calibrated cameras, two problems which have previously...