427 search results - page 20 / 86 » Computing the Local Consensus of Trees |
CGF
2005
14 years 9 months ago
2005
New techniques are presented for rendering complex hierarchical skeletal implicit models in several pen-and-ink styles. A particle system is employed to find interesting areas on ...
97
Voted
IWOCA
2010
Springer
14 years 4 months ago
2010
Springer
A homomorphism from a graph G to a graph R is locally surjective if its restriction to the neighborhood of each vertex of G is surjective. Such a homomorphism is also called an R-r...
80
Voted
IPTPS
2005
Springer
15 years 3 months ago
2005
Springer
There is an increasing demand for locality-preserving distribution of complex data structures in peer-to-peer systems. Current systems either do not preserve object locality or su...
EMMCVPR
2001
Springer
15 years 1 months ago
2001
Springer
—Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an associati...
CVPR
2010
IEEE
14 years 9 months ago
2010
IEEE
We present a novel approach to fully automated delineation of tree structures in noisy 2D images and 3D image stacks. Unlike earlier methods that rely mostly on local evidence, ou...