365 search results - page 19 / 73 » An Approach to Multiply Segmented Constraint Satisfaction Pr... |
EOR
2008
13 years 11 months ago
2008
Our problem of interest consists of minimizing a separable, convex and differentiable function over a convex set, defined by bounds on the variables and an explicit constraint des...
NIPS
2000
14 years 5 days ago
2000
We study the problem of combining the outcomes of several different classifiers in a way that provides a coherent inference that satisfies some constraints. In particular, we deve...
CP
2001
Springer
14 years 3 months ago
2001
Springer
Initial value problems for parametric ordinary differential equations (ODEs) arise in many areas of science and engineering. Since some of the data is uncertain, traditional numer...
ICCV
2007
IEEE
15 years 24 days ago
2007
IEEE
Indisputably Normalized Cuts is one of the most popular segmentation algorithms in computer vision. It has been applied to a wide range of segmentation tasks with great success. A...
IAT
2003
IEEE
14 years 4 months ago
2003
IEEE
With the increasing use of the internet, many problemsolving tasks such as resource allocation, scheduling, planning, and configuration pose themselves in an open setting involvi...