828 search results - page 50 / 166 » Simplicial Powers of Graphs |
148
click to vote
DAC
1998
ACM
15 years 6 months ago
1998
ACM
We present a technique for synthesizing power- as well as area-optimized circuits from hierarchical data flow graphs under throughput constraints. We allow for the use of complex...
WG
2004
Springer
15 years 7 months ago
2004
Springer
The Phylogenetic kth Root Problem (PRk) is the problem of finding a (phylogenetic) tree T from a given graph G = (V, E) such that (1) T has no degree-2 internal nodes, (2) the ex...
108
click to vote
EUROGRAPHICS
2010
Eurographics
15 years 11 months ago
2010
Eurographics
Continuous constrained optimization is a powerful tool for synthesizing novel human motion segments that are short. Graph-based motion synthesis methods such as motion graphs and ...
132
click to vote
PKDD
2009
Springer
15 years 8 months ago
2009
Springer
We propose a new, recursive model to generate realistic graphs, evolving over time. Our model has the following properties: it is (a) flexible, capable of generating the cross pro...
127
click to vote
STACS
1992
Springer
15 years 6 months ago
1992
Springer
We show that the graph isomorphism problem is low for PP and for C=P, i.e., it does not provide a PP or C=P computation with any additional power when used as an oracle. Furthermor...