Sciweavers

1149 search results - page 65 / 230
» Minimally non-Pfaffian graphs
Sort
View
SCIA
2007
Springer
153views Image Analysis» more  SCIA 2007»
15 years 6 months ago
Graph Cut Based Segmentation of Soft Shadows for Seamless Removal and Augmentation
Abstract. This paper introduces a new concept within shadow segmentation for usage in shadow removal and augmentation through construction of a multiplicity alpha overlay shadow mo...
Michael Nielsen, Claus B. Madsen
ICDM
2006
IEEE
134views Data Mining» more  ICDM 2006»
15 years 6 months ago
Fast Frequent Free Tree Mining in Graph Databases
Free tree, as a special graph which is connected, undirected and acyclic, is extensively used in domains such as computational biology, pattern recognition, computer networks, XML...
Peixiang Zhao, Jeffrey Xu Yu
ACCV
2006
Springer
15 years 5 months ago
Stereo Matching Using Iterated Graph Cuts and Mean Shift Filtering
In this paper, we propose a new stereo matching algorithm using an iterated graph cuts and mean shift filtering technique. Our algorithm consists of following two steps. In the ...
Ju Yong Chang, Kyoung Mu Lee, Sang Uk Lee
LCPC
2005
Springer
15 years 5 months ago
Revisiting Graph Coloring Register Allocation: A Study of the Chaitin-Briggs and Callahan-Koblenz Algorithms
Techniques for global register allocation via graph coloring have been extensively studied and widely implemented in compiler frameworks. This paper examines a particular variant ...
Keith D. Cooper, Anshuman Dasgupta, Jason Eckhardt
ICPP
2002
IEEE
15 years 4 months ago
Power Aware Scheduling for AND/OR Graphs in Multi-Processor Real-Time Systems
Power aware computing has become popular recently and many techniques have been proposed to manage the energy consumption for traditional real-time applications. We have previousl...
Dakai Zhu, Nevine AbouGhazaleh, Daniel Mossé...