Sciweavers

3373 search results - page 249 / 675
» Linear transformations on codes
Sort
View
INFOCOM
2009
IEEE
15 years 11 months ago
Network Coding Meets TCP
—We propose a mechanism that incorporates network coding into TCP with only minor changes to the protocol stack, thereby allowing incremental deployment. In our scheme, the sourc...
Jay Kumar Sundararajan, Devavrat Shah, Muriel M&ea...
DELTA
2004
IEEE
15 years 8 months ago
Spectral Warping Revisited
Spectral warping is a time domain to time domain transformation on a signal that effectively warps the frequency content of the original signal. Here we present a matrix formulati...
Donald G. Bailey, Warwick Allen, Serge N. Demidenk...
COCO
2004
Springer
147views Algorithms» more  COCO 2004»
15 years 8 months ago
The Complexity of the Covering Radius Problem on Lattices and Codes
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...
Venkatesan Guruswami, Daniele Micciancio, Oded Reg...
CODES
2000
IEEE
15 years 8 months ago
Compaan: deriving process networks from Matlab for embedded signal processing architectures
This paperpresents the Compaantool that automatically transforms a nestedloopprogram written in Matlab into a processnetwork specification. The processnetworkmodelof computation...
Bart Kienhuis, Edwin Rijpkema, Ed F. Deprettere
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
16 years 5 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy