5606 search results - page 519 / 1122 » Randomization Techniques for Graphs. |
185
click to vote
ASYNC
1997
IEEE
15 years 11 months ago
1997
IEEE
This paper introduces a novel technique for synthesis of speed-independent circuits from their Signal Transition Graph specifications. The new method uses partial order in the fo...
216
click to vote
AAIM
2007
Springer
15 years 11 months ago
2007
Springer
Given an acyclic directed graph and two distinct nodes s and t, we consider the problem of finding k disjoint paths from s to t satisfying some objective. We consider four objectiv...
180
click to vote
ICCD
1995
IEEE
15 years 10 months ago
1995
IEEE
Optimization of hardware resources for conditional data-flow graph behavior is particularly important when conditional behavior occurs in cyclic loops and maximization of through...
161
click to vote
DAGSTUHL
2006
15 years 8 months ago
2006
The extended abstract describes a method for recognizing similar sub-parts of objects described by 3D polygonal meshes. The innovation of this method is the coupling of structure a...
206
click to vote
OSDI
2006
ACM
16 years 7 months ago
2006
ACM
Software attacks often subvert the intended data-flow in a vulnerable program. For example, attackers exploit buffer overflows and format string vulnerabilities to write data to u...