2244 search results - page 155 / 449 » A new heuristic approach for non-convex optimization problem... |
175
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
In this paper, we discuss and compare several policies to place replicas in tree networks, subject to server capacity constraints. The client requests are known beforehand, while ...
213
click to vote
ICCV
1998
IEEE
15 years 11 months ago
1998
IEEE
This paper describes a new algorithm for solving the N-camera stereo correspondence problem by transforming it into a maximum- ow problem. Once solved, the minimum-cut associated ...
198
click to vote
AIPS
2008
15 years 9 months ago
2008
In the last decades, there has been an increasing interest in the connection between planning and constraint programming. Several approaches were used, leading to different forms ...
202
click to vote
FOCM
2010
15 years 5 months ago
2010
We show how to approximate the feasible region of structured convex optimization problems by a family of convex sets with explicitly given and efficient (if the accuracy of the ap...
180
click to vote
CVPR
2001
IEEE
16 years 9 months ago
2001
IEEE
This paper proposes a new Bayesian framework for solving the matting problem, i.e. extracting a foreground element from a background image by estimating an opacity for each pixel ...