Sciweavers

866 search results - page 42 / 174
» Algorithms for Comparing Pedigree Graphs
Sort
View
ICPADS
2007
IEEE
14 years 3 months ago
Parallel Minimum Spanning Tree Heuristic for the steiner problem in graphs
Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes...
Hoda Akbari, Zeinab Iranmanesh, Mohammad Ghodsi
CVPR
2004
IEEE
14 years 11 months ago
Segment-Based Stereo Matching Using Graph Cuts
In this paper, we present a new segment-based stereo matching algorithm using graph cuts. In our approach, the reference image is divided into non-overlapping homogeneous segments...
Li Hong, George Chen
ECCV
2010
Springer
14 years 2 months ago
Finding Semantic Structures in Image Hierarchies using Laplacian Graph Energy
Many segmentation algorithms describe images in terms of a hierarchy of regions. Although such hierarchies can produce state of the art segmentations and have many applications, th...
CIKM
2010
Springer
13 years 7 months ago
Domain-independent entity coreference in RDF graphs
In this paper, we present a novel entity coreference algorithm for Semantic Web instances. The key issues include how to locate context information and how to utilize the context ...
Dezhao Song, Jeff Heflin
FUZZIEEE
2007
IEEE
14 years 3 months ago
Learning Undirected Possibilistic Networks with Conditional Independence Tests
—Approaches based on conditional independence tests are among the most popular methods for learning graphical models from data. Due to the predominance of Bayesian networks in th...
Christian Borgelt