Sciweavers

3373 search results - page 509 / 675
» Linear transformations on codes
Sort
View
SIAMDM
2011
14 years 5 months ago
Origins of Nonlinearity in Davenport-Schinzel Sequences
Abstract. A generalized Davenport–Schinzel sequence is one over a finite alphabet that excludes subsequences isomorphic to a fixed forbidden subsequence. The fundamental proble...
Seth Pettie
113
Voted
TASLP
2010
134views more  TASLP 2010»
14 years 4 months ago
Autoregressive Models of Amplitude Modulations in Audio Compression
We present a scalable medium bit-rate wide-band audio coding technique based on frequency domain linear prediction (FDLP). FDLP is an efficient method for representing the long-ter...
Sriram Ganapathy, Petr Motlícek, Hynek Herm...
POPL
2009
ACM
15 years 10 months ago
SPEED: precise and efficient static estimation of program computational complexity
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...
Sumit Gulwani, Krishna K. Mehra, Trishul M. Chilim...
ESOP
2009
Springer
15 years 5 months ago
Amortised Memory Analysis Using the Depth of Data Structures
Hofmann and Jost have presented a heap space analysis [1] that finds linear space bounds for many functional programs. It uses an amortised analysis: assigning hypothetical amount...
Brian Campbell
ICC
2008
IEEE
175views Communications» more  ICC 2008»
15 years 4 months ago
Routing in Cooperative Wireless Networks with Mutual-Information Accumulation
Cooperation between the nodes of wireless multihop networks can increase communication reliability, reduce energy consumption, and decrease latency. The possible improvements are ...
Stark C. Draper, Lingjia Liu, Andreas F. Molisch, ...