Sciweavers

3396 search results - page 185 / 680
» Tree representations of graphs
Sort
View
GECCO
2000
Springer
127views Optimization» more  GECCO 2000»
14 years 23 days ago
Evolving Molecules for Drug Design Using Genetic Algorithms via Molecular Trees
We present a new representation for a genetic algorithm to evolve molecular structures representing possible drugs that bind to a given protein target receptor. Our representation...
Gerard Kian-Meng Goh, James A. Foster
CVPR
2010
IEEE
14 years 5 months ago
Globally Optimal Pixel Labeling Algorithms for Tree Metrics
We consider pixel labeling problems where the label set forms a tree, and where the observations are also labels. Such problems arise in feature-space analysis with a very large...
Pedro Felzenszwalb, Gyula Pap, Eva Tardos, Ramin Z...
ICALP
1995
Springer
14 years 22 days ago
Parallel Algorithms with Optimal Speedup for Bounded Treewidth
We describe the rst parallel algorithm with optimal speedup for constructing minimum-width tree decompositions of graphs of bounded treewidth. On n-vertex input graphs, the algori...
Hans L. Bodlaender, Torben Hagerup
CVPR
2010
IEEE
14 years 5 months ago
Fast Globally Optimal 2D Human Detection with Loopy Graph Models
This paper presents an algorithm for recovering the globally optimal 2D human figure detection using a loopy graph model. This is computationally challenging because the time comp...
Tai-Peng Tian, Stan Sclaroff
DAM
2010
81views more  DAM 2010»
13 years 9 months ago
The k-in-a-tree problem for graphs of girth at least k
For all integers k 3, we give an O(n4 ) time algorithm for the problem whose instance is a graph G of girth at least k together with k vertices and whose question is "Does G...
W. Liu, Nicolas Trotignon