4137 search results - page 113 / 828 » On the number of matchings of a tree |
182
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
We study the random m-ary search tree model (where m stands for the number of branches of the search tree), an important problem for data storage in computer science, using a varie...
203
click to vote
AINA
2005
IEEE
16 years 2 days ago
2005
IEEE
A core-based group-shared multicast tree is a shortest path tree rooted at core node that distributes packets to and from all group members. Traditionally, the bandwidth cost cons...
197
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
164
click to vote
ISI
2008
Springer
15 years 6 months ago
2008
Springer
ABSTRACT. Schema matching is a crucial task to gather information of the same domain. However, this process is still largely performed manually or semi-automatically, discouraging ...
139
click to vote
IVC
2000
15 years 6 months ago
2000
Feature matching is a prerequisite to a wide variety of vision tasks. This paper presents a method that addresses the problem of matching disparate views of coplanar points and li...