4137 search results - page 257 / 828 » On the number of matchings of a tree |
199
click to vote
PDCAT
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. Survivable network design has become increasingly important due to the need for reliable communication service. Its main purpose is to provide cost-efficient spare capaci...
179
click to vote
CVPR
2006
IEEE
16 years 24 days ago
2006
IEEE
A recognition scheme that scales efficiently to a large number of objects is presented. The efficiency and quality is exhibited in a live demonstration that recognizes CD-covers...
152
click to vote
EUROCRYPT
2004
Springer
16 years 3 days ago
2004
Springer
Abstract. We present a technique for Merkle tree traversal which requires only logarithmic space and time1 . For a tree with N nodes, our algorithm computes sequential tree leaves ...
202
click to vote
DAC
1994
ACM
15 years 10 months ago
1994
ACM
We provide a new theoretical framework for constructing Steiner routing trees with minimum Elmore delay. Earlier work [3, 13] has established Elmore delay as a high delity estima...
156
click to vote
FLAIRS
2004
15 years 8 months ago
2004
Artificial Neural Networks (ANNs) have proved both a popular and powerful technique for pattern recognition tasks in a number of problem domains. However, the adoption of ANNs in ...