Sciweavers

TVLSI
2002
94views more  TVLSI 2002»
13 years 4 months ago
A network flow approach to memory bandwidth utilization in embedded DSP core processors
This paper presents a network flow approach to solving the register binding and allocation problem for multiword memory access DSP processors. In recently announced DSP processors,...
Catherine H. Gebotys
TIT
2008
112views more  TIT 2008»
13 years 4 months ago
Rainbow Network Flow of Multiple Description Codes
This paper is an enquiry into the interaction between multiple description coding (MDC) and network routing. We are mainly concerned with rate-distortion optimized network flow of...
Xiaolin Wu, Bin Ma, Nima Sarshar
NETWORKS
2006
13 years 4 months ago
Extreme point characterizations for infinite network flow problems
We study capacitated network flow problems with supplies and demands defined on a countably infinite collection of nodes having finite degree. This class of network flow models in...
H. Edwin Romeijn, Dushyant Sharma, Robert L. Smith
USS
2008
13 years 6 months ago
Multi-flow Attacks Against Network Flow Watermarking Schemes
We analyze several recent schemes for watermarking network flows based on splitting the flow into intervals. We show that this approach creates time dependent correlations that en...
Negar Kiyavash, Amir Houmansadr, Nikita Borisov
BIRTHDAY
2006
Springer
13 years 8 months ago
Optimal Flow Distribution Among Multiple Channels with Unknown Capacities
Consider a simple network flow problem in which there are n channels directed from a source to a sink. The channel capacities are unknown and we wish to determine a feasible netwo...
Richard M. Karp, Till Nierhoff, Till Tantau
FMCAD
2007
Springer
13 years 10 months ago
Fast Minimum-Register Retiming via Binary Maximum-Flow
We present a formulation of retiming to minimize the number of registers in a design by iterating a maximum network flow problem. The retiming returned will be the optimum one whi...
Aaron P. Hurst, Alan Mishchenko, Robert K. Brayton