273 search results - page 19 / 55 » Can Pure Cutting Plane Algorithms Work |
ATAL
2005
Springer
14 years 1 months ago
2005
Springer
The next generation of air traffic control will require automated decision support systems in order to meet safety, reliability, flexibility, and robustness demands in an environ...
NIPS
2008
13 years 9 months ago
2008
We consider the problem of multiple kernel learning (MKL), which can be formulated as a convex-concave problem. In the past, two efficient methods, i.e., Semi-Infinite Linear Prog...
SI3D
2005
ACM
14 years 1 months ago
2005
ACM
The broad-phase step of collision detection in scenes composed of n moving objects is a challenging problem because enumerating collision pairs has an inherent O(n2) complexity. S...
IJCV
2007
13 years 7 months ago
2007
Abstract. We address the problem of finding the correspondences of two point sets in 3D undergoing a rigid transformation. Using these correspondences the motion between the two s...
CVPR
2010
IEEE
14 years 4 months ago
2010
IEEE
Purely bottom-up, unsupervised segmentation of a single
image into two segments remains a challenging task for
computer vision. The co-segmentation problem is the process
of joi...