6413 search results - page 171 / 1283 » Classes of cycle bases |
158
click to vote
DAC
2005
ACM
15 years 8 months ago
2005
ACM
This paper proposes a rapid and accurate evaluation scheme for cycle counts of a pipelined processor using evaluation reuse technique. Since exploration of an optimal processor is...
180
click to vote
WORM
2003
15 years 8 months ago
2003
We present a general framework for reasoning about network worms and analyzing the potency of worms within a specific network. First, we present a discussion of the life cycle of ...
170
click to vote
GD
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. We present a linear-time algorithm for solving the simultaneous embedding problem with fixed edges (SEFE) for a planar graph and a pseudoforest (a graph with at most one...
159
click to vote
AI
1999
Springer
15 years 6 months ago
1999
Springer
Reasoning about the physical world is a central human cognitive activity. One aspect of such reasoning is the inference of function from the structure of the artifacts one encount...
219
click to vote
SIAMDM
2010
15 years 5 months ago
2010
For a fixed graph H, let Ret(H) denote the problem of deciding whether a given input graph is retractable to H. We classify the complexity of Ret(H) when H is a graph (with loops ...