Sciweavers

2314 search results - page 254 / 463
» Minimal Partitions of a Graph
Sort
View
SIBGRAPI
2007
IEEE
15 years 10 months ago
Graph-based Object Tracking Using Structural Pattern Recognition
This paper proposes a model-based methodology for recognizing and tracking objects in digital image sequences. Objects are represented by attributed relational graphs (or ARGs), w...
Ana Beatriz V. Graciano, Roberto Marcondes Cesar J...
SMI
2006
IEEE
121views Image Analysis» more  SMI 2006»
15 years 10 months ago
Minimum Ratio Contours on Surface Meshes
We present a novel approach for discretely optimizing contours on the surface of a triangle mesh. This is achieved through the use of a minimum ratio cycle (MRC) algorithm, where ...
Andrew Clements, Hao Zhang 0002
CPM
1994
Springer
123views Combinatorics» more  CPM 1994»
15 years 8 months ago
Computing all Suboptimal Alignments in Linear Space
Recently, a new compact representation for suboptimal alignments was proposed by Naor and Brutlag (1993). The kernel of that representation is a minimal directed acyclic graph (DAG...
Kun-Mao Chao
FLAIRS
2006
15 years 5 months ago
Methods for Constructing Balanced Elimination Trees and Other Recursive Decompositions
A conditioning graph is a form of recursive factorization which minimizes the memory requirements and simplifies the implementation of inference in Bayesian networks. The time com...
Kevin Grant, Michael C. Horsch
ALGORITHMICA
2008
63views more  ALGORITHMICA 2008»
15 years 4 months ago
The Swap Edges of a Multiple-Sources Routing Tree
Let T be a spanning tree of a graph G and S V (G) be a set of sources. The routing cost of T is the total distance from all sources to all vertices. For an edge e of T, the swap ...
Bang Ye Wu, Chih-Yuan Hsiao, Kun-Mao Chao