Sciweavers

828 search results - page 72 / 166
» Simplicial Powers of Graphs
Sort
View
ALGORITHMICA
2004
111views more  ALGORITHMICA 2004»
13 years 7 months ago
Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems
We present a framework for an automated generation of exact search tree algorithms for NP-hard problems. The purpose of our approach is two-fold--rapid development and improved up...
Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Nie...
CVPR
2009
IEEE
15 years 2 months ago
Higher-Order Clique Reduction in Binary Graph Cut
We introduce a new technique that can reduce any higher-order Markov random field with binary labels into a first-order one that has the same minima as the original. Moreover, w...
Hiroshi Ishikawa 0002
CVPR
2003
IEEE
14 years 9 months ago
Joint 3D-Reconstruction and Background Separation in Multiple Views using Graph Cuts
This paper deals with simultaneous depth map estimation and background separation in a multi-view setting with several fixed calibrated cameras, two problems which have previously...
Bastian Goldlücke, Marcus A. Magnor
ICDE
2001
IEEE
159views Database» more  ICDE 2001»
14 years 9 months ago
Workflow and Process Synchronization with Interaction Expressions and Graphs
Current workflow management technology does not provide adequate means for inter-workflow coordination as concurrently executing workflows are considered completely independent. W...
Christian Heinlein
ICPR
2008
IEEE
14 years 2 months ago
Application of graph coloring in physical layout segmentation
Every-day, the postal sorting systems diffuse several tons of mails. It is noted that the principal origin of mail rejection is related to the failure of address-block localizatio...
Djamel Gaceb, Véronique Eglin, Frank Lebour...