1243 search results - page 107 / 249 » Generating Trees on Multisets |
110
click to vote
ICS
2009
Tsinghua U.
15 years 2 months ago
2009
Tsinghua U.
New static source routing algorithms for High Performance Computing (HPC) are presented in this work. The target parallel architectures are based on the commonly used fattree netw...
ICCAD
1994
IEEE
15 years 2 months ago
1994
IEEE
We propose a technology mapping algorithm that takes existing structural technology-mapping algorithms based on dynamic programming [1,3,4] and extends them to retime pipelined cir...
CORR
2011
Springer
14 years 1 months ago
2011
Springer
For large, real-world inductive learning problems, the number of training examples often must be limited due to the costs associated with procuring, preparing, and storing the tra...
IACR
2011
13 years 9 months ago
2011
A transitive signature scheme allows to sign a graph in such a way that, given the signatures of edges (a, b) and (b, c), it is possible to compute the signature for the edge (or ...
116
click to vote
ESOP
2000
Springer
15 years 1 months ago
2000
Springer
We exhibit a technique for automatically verifying the safety of simple C programs working on tree-shaped data structures. We do not consider the complete behavior of programs, but...