Sciweavers

3678 search results - page 195 / 736
» On the Stable Paths Problem
Sort
View
PAMI
1998
93views more  PAMI 1998»
15 years 3 months ago
Stereo Matching as a Nearest-Neighbor Problem
—We propose a representation of images, called intrinsic curves, that transforms stereo matching from a search problem into a nearest-neighbor problem. Intrinsic curves are the p...
Carlo Tomasi, Roberto Manduchi
FCT
1999
Springer
15 years 8 months ago
Restrictive Acceptance Suffices for Equivalence Problems
One way of suggesting that an NP problem may not be NP-complete is to show that it is in the promise class UP. We propose an analogous new method—weaker in strength of evidence ...
Bernd Borchert, Lane A. Hemaspaandra, Jörg Ro...
DAM
2008
108views more  DAM 2008»
15 years 3 months ago
On the complexity of the multicut problem in bounded tree-width graphs and digraphs
Given an edge- or vertex-weighted graph or digraph and a list of source-sink pairs, the minimum multicut problem consists in selecting a minimum weight set of edges or vertices wh...
Cédric Bentz
JAIR
2006
131views more  JAIR 2006»
15 years 3 months ago
Asynchronous Partial Overlay: A New Algorithm for Solving Distributed Constraint Satisfaction Problems
Distributed Constraint Satisfaction (DCSP) has long been considered an important problem in multi-agent systems research. This is because many real-world problems can be represent...
Roger Mailler, Victor R. Lesser
EOR
2007
84views more  EOR 2007»
15 years 3 months ago
The multi-layered network design problem
act 11 We address the problem of designing a network built on several layers. This problem occurs in practical applications 12 but has not been studied extensively from the point o...
Arnaud Knippel, Benoit Lardeux