4137 search results - page 218 / 828 » On the number of matchings of a tree |
167
click to vote
DAC
1995
ACM
15 years 10 months ago
1995
ACM
āMotivated by the goal of increasing the performance of FPGA-based designs, we propose new Steiner and arborescence FPGA routing algorithms. Our Steiner tree constructions signiļ...
173
click to vote
CGVR
2006
15 years 8 months ago
2006
In this paper we introduce an algorithm for simplifying a 2D discrete region. This algorithm is based on a bipolar model of regions. Given a discrete region, we cut its Voronoi di...
166
click to vote
CCCG
2003
15 years 8 months ago
2003
We consider the problem of constructing binary space partitions for the set P of d-dimensional objects in d-dimensional space. There are several classes of objects deļ¬ned for su...
175
click to vote
IADIS
2003
15 years 8 months ago
2003
In this short paper, we propose a new key management architecture for Multicast communications. This architecture combines the complementary variable approach with hashed keys and...
190
click to vote
CIKM
1993
Springer
15 years 10 months ago
1993
Springer
match algorithms that can efficiently handleAbstract complex tests in the presence of large amounts of data. Match algorithms that are capable of handling large amounts of On the o...