Sciweavers

2398 search results - page 94 / 480
» Constraint Programming and Graph Algorithms
Sort
View
IJDAR
2006
245views more  IJDAR 2006»
15 years 4 months ago
Object count/area graphs for the evaluation of object detection and segmentation algorithms
Evaluation of object detection algorithms is a non-trivial task: a detection result is usually evaluated by comparing the bounding box of the detected object with the bounding box...
Christian Wolf, Jean-Michel Jolion
157
Voted
NIPS
2007
15 years 6 months ago
A Constraint Generation Approach to Learning Stable Linear Dynamical Systems
Stability is a desirable characteristic for linear dynamical systems, but it is often ignored by algorithms that learn these systems from data. We propose a novel method for learn...
Sajid M. Siddiqi, Byron Boots, Geoffrey J. Gordon
ATAL
2006
Springer
15 years 8 months ago
No-commitment branch and bound search for distributed constraint optimization
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
Anton Chechetka, Katia P. Sycara
145
Voted
FOCS
1990
IEEE
15 years 9 months ago
Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time
For any xed dimension d, the linear programming problem with n inequality constraints can be solved on a probabilistic CRCW PRAM with O(n) processors almost surely in constant time...
Noga Alon, Nimrod Megiddo
133
Voted
COMBINATORICA
2008
89views more  COMBINATORICA 2008»
15 years 5 months ago
The stable set polytope of quasi-line graphs
It is a long standing open problem to find an explicit description of the stable set polytope of clawfree graphs. Yet more than 20 years after the discovery of a polynomial algori...
Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier St...