94 search results - page 1 / 19 » Turning Cycles into Spirals |
APAL
1999
13 years 4 months ago
1999
ICIP
2010
IEEE
13 years 2 months ago
2010
IEEE
The Fast Fourier Transform (FFT) allows the Discrete Time Fourier Transform (DTFT) to be efficiently sampled on a uniform grid in frequency. In many applications, including Magnet...
JGAA
2006
13 years 5 months ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
NSDI
2008
13 years 7 months ago
2008
While the web provides information and services that enrich our lives in many ways, it has also become the primary vehicle for delivering malware. Once infected with web-based mal...
TPDS
2010
13 years 3 months ago
2010
Abstract—We propose an algorithm that provides for deadlockfree and livelock-free routing, in particular in wormhole routed networks. The proposed algorithm requires nearly minim...