5606 search results - page 210 / 1122 » Randomization Techniques for Graphs. |
107
click to vote
ISSS
1999
IEEE
15 years 5 months ago
1999
IEEE
Synchronous Dataflow, a subset of dataflow, has proven to be a good match for specifying DSP programs. Because of the limited amount of memory in embedded DSPs, a key problem duri...
64
Voted
DAC
1996
ACM
15 years 4 months ago
1996
ACM
Abstract: Introspection, a zero-overhead binding technique during self-diagnosing microarchitecture synthesis is presented. Given a scheduled control data ow graph (CDFG) introspec...
70
Voted
COMBINATORICA
2004
15 years 18 days ago
2004
We present a new method to show concentration of the upper tail of random variables that can be written as sums of variables with plenty of independence. We compare our method with...
96
Voted
VISUALIZATION
2000
IEEE
15 years 5 months ago
2000
IEEE
We present a new approach to surface reconstruction based on the Delaunay complex. First we give a simple and fast algorithm that picks locally a surface at each vertex. For that,...
102
Voted
ENTCS
2007
15 years 22 days ago
2007
In this paper, we survey algorithms for shortest paths in dynamic networks. Although research on this problem spans over more than three decades, in the last couple of years many ...