91 search results - page 17 / 19 » A supertree method for rooted trees |
117
Voted
SPAA
2004
ACM
15 years 5 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
102
click to vote
AI
2006
Springer
15 years 12 days ago
2006
Springer
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
102
click to vote
ROMAN
2007
IEEE
15 years 6 months ago
2007
IEEE
Abstract—Models that can efficiently, compactly, and semantically represent potential users are important tools for human-robot interaction applications. We model a person as a p...
116
click to vote
WIDM
2004
ACM
15 years 5 months ago
2004
ACM
In this paper, we propose a set of similarity metrics for manipulating collections of values occuring in XML documents. Following the data model presented in TAX algebra, we treat...
ER
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. We present a new technique for discovering and representing structural changes between two versions of a directed acyclic graph (DAG). Motivated by the necessity of chang...