4137 search results - page 264 / 828 » On the number of matchings of a tree |
167
click to vote
CRYPTO
1999
Springer
15 years 11 months ago
1999
Springer
Several variations of rooted tree based solutions have been recently proposed for member revocation in multicast communications [18, 19, 20, 21]. In this paper, we show that by ass...
184
click to vote
DAC
1989
ACM
15 years 10 months ago
1989
ACM
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...
171
click to vote
KDD
1995
ACM
15 years 10 months ago
1995
ACM
Knowledge discovery in databases has become an increasingly important research topic with the advent of wide area network computing. One of the crucial problems we study in this p...
173
click to vote
COCO
1991
Springer
15 years 10 months ago
1991
Springer
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
181
click to vote
ISMB
2007
15 years 9 months ago
2007
Gene duplication and divergence is a major evolutionary force. Despite the growing number of fully sequenced genomes, methods for investigating these events on a genome-wide scale...