599 search results - page 33 / 120 » The repeater tree construction problem |
125
click to vote
EMMCVPR
2001
Springer
15 years 8 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...
145
click to vote
APWEB
2005
Springer
15 years 9 months ago
2005
Springer
This paper presents a new method for visualizing and navigating huge graphs. The main feature of this method is that it applies Level-Of-Detail (LOD) strategy to graph visualizati...
135
click to vote
ICALP
2009
Springer
15 years 11 months ago
2009
Springer
We consider the problem of constructing decision trees for entity identification from a given table. The input is a table containing information about a set of entities over a fi...
139
click to vote
WOB
2004
15 years 5 months ago
2004
We developed a new approach for the reconstruction of phylogenetic trees using ant colony optimization metaheuristics.Atree is constructed using a fully connected graph and the pro...
130
click to vote
TCAD
2002
15 years 3 months ago
2002
Abstract--This paper presents a solution to the problem of performance-driven buffered routing tree generation for VLSI circuits. Using a novel bottom-up construction algorithm and...