Sciweavers

3396 search results - page 50 / 680
» Tree representations of graphs
Sort
View
CVPR
2004
IEEE
14 years 10 months ago
Tracking Loose-Limbed People
We pose the problem of 3D human tracking as one of inference in a graphical model. Unlike traditional kinematic tree representations, our model of the body is a collection of loos...
Leonid Sigal, Sidharth Bhatia, Stefan Roth, Michae...
IFL
1997
Springer
136views Formal Methods» more  IFL 1997»
14 years 29 days ago
Fully Persistent Graphs - Which One To Choose?
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...
Martin Erwig
CEC
2011
IEEE
12 years 8 months ago
Cost-benefit analysis of using heuristics in ACGP
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
John W. Aleshunas, Cezary Z. Janikow
ALGORITHMICA
2005
97views more  ALGORITHMICA 2005»
13 years 8 months ago
Representing Trees of Higher Degree
This paper focuses on space efficient representations of rooted trees that permit basic navigation in constant time. While most of the previous work has focused on binary trees, w...
David Benoit, Erik D. Demaine, J. Ian Munro, Rajee...
DAM
2007
108views more  DAM 2007»
13 years 8 months ago
3D-interval-filament graphs
: Gavril [GA4] defined two new families of intersection graphs: the interval-filament graphs and the subtree-filament graphs. The complements of intervalfilament graphs are the coi...
Fanica Gavril