154 search results - page 12 / 31 » Approximated Consistency for Knapsack Constraints |
230
click to vote
ECCV
2004
Springer
16 years 1 months ago
2004
Springer
Photometric stereo algorithms use a Lambertian reflectance model with a varying albedo field and involve the appearances of only one object. This paper extends photometric stereo a...
110
click to vote
WIOPT
2005
IEEE
15 years 5 months ago
2005
IEEE
We consider the problem of transmission scheduling of data over a wireless fading channel with hard deadline constraints. Our system consists of N users, each with a fixed amount...
CP
2004
Springer
15 years 5 months ago
2004
Springer
In CP literature combinatorial design problems such as sport scheduling, Steiner systems, error-correcting codes and more, are typically solved using Finite Domain (FD) models desp...
112
click to vote
ICRA
2003
IEEE
15 years 5 months ago
2003
IEEE
— In this paper we present a novel method for robot path planning based on learning motion patterns. A motion pattern is defined as the path that results from applying a set of ...
99
Voted
CVPR
2012
IEEE
13 years 2 months ago
2012
IEEE
A popular approach to pixel labeling problems, such as multiclass image segmentation, is to construct a pairwise conditional Markov random field (CRF) over image pixels where the...