4137 search results - page 620 / 828 » On the number of matchings of a tree |
FSTTCS
2003
Springer
14 years 1 months ago
2003
Springer
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with ed...
AINA
2010
IEEE
14 years 1 months ago
2010
IEEE
—Conventional broadcasting protocols suffer from network congestion, frequent message losses and corruption of broadcast messages due to a vast number of duplicate packets transm...
3DPVT
2002
IEEE
14 years 1 months ago
2002
IEEE
The iterative closest point (ICP) algorithm is widely used for the registration of geometric data. One of its main drawbacks is its quadratic time complexity O(N2 ) with the shape...
ICDCS
2002
IEEE
14 years 1 months ago
2002
IEEE
: A reliable multicast algorithm, called RMA, for mobile ad hoc networks is presented that is based on a new cost criterion, called link lifetime, for determining the optimal path ...
ICSM
2002
IEEE
14 years 1 months ago
2002
IEEE
During the past ten years, a large number of quality models have been proposed in the literature. In general, the goal of these models is to predict a quality factor starting from...