9842 search results - page 1657 / 1969 » The Complexity of the Matching-Cut Problem |
134
click to vote
ISRR
2001
Springer
15 years 9 months ago
2001
Springer
This paper describes the foundations and algorithms of a new probabilistic roadmap (PRM) planner that is: (1) singlequery –i.e., it does not pre-compute a roadmap, but uses the ...
172
click to vote
IWVF
2001
Springer
15 years 9 months ago
2001
Springer
We consider the problem of recognizing an object from its silhouette. We focus on the case in which the camera translates, and rotates about a known axis parallel to the image, suc...
135
click to vote
SAGA
2001
Springer
15 years 9 months ago
2001
Springer
We study the combinatorial optimization task of choosing the smoothest map from a given family of maps, which is motivated from motor control unit calibration. The problem is of a ...
124
click to vote
APSEC
2000
IEEE
15 years 9 months ago
2000
IEEE
of modelling abstractions to map from items in the real-world to objects in the computational domain is oth for the effective implementation of abstract problem solutions and for ...
136
click to vote
INFOCOM
2000
IEEE
15 years 9 months ago
2000
IEEE
— We study wavelength assignment for lightpaths over WDM rings to minimize the SONET ADMs used. This problem has attracted much attention recently. However, its computation compl...