Sciweavers

6404 search results - page 306 / 1281
» Blocks
Sort
View
AUTOMATICA
2006
70views more  AUTOMATICA 2006»
15 years 6 months ago
A Toeplitz algorithm for polynomial J-spectral factorization
A block Toeplitz algorithm is proposed to perform the J-spectral factorization of a para-Hermitian polynomial matrix. The input matrix can be singular or indefinite, and it can ha...
Juan Carlos Zúñiga, Didier Henrion
ENTCS
2007
98views more  ENTCS 2007»
15 years 6 months ago
Type Systems for Optimizing Stack-based Code
We give a uniform type-systematic account of a number of optimizations and the underlying analyses for a bytecode-like stack-based low-level language, including analysis soundness...
Ando Saabas, Tarmo Uustalu
TIT
2008
73views more  TIT 2008»
15 years 6 months ago
Turbo Codes in Binary Erasure Channel
In this correspondence, the stopping set of turbo codes with iterative decoding in the binary erasure channel is defined. Block and bit erasure probabilities of turbo codes are stu...
Jeong Woo Lee, Rüdiger L. Urbanke, Richard E....
TMM
2008
121views more  TMM 2008»
15 years 6 months ago
Performance Analysis of Resource Selection Schemes for a Large Scale Video-on-Demand System
The designers of a large scale video-on-demand system face an optimization problem of deciding how to assign movies to multiple disks (servers) such that the request blocking proba...
Jun Guo, Eric Wing Ming Wong, Sammy Chan, Peter Ta...
CORR
2004
Springer
121views Education» more  CORR 2004»
15 years 6 months ago
Worst-Case Optimal Tree Layout in a Memory Hierarchy
Consider laying out a fixed-topology tree of N nodes into external memory with block size B so as to minimize the worst-case number of block memory transfers required to traverse ...
Erik D. Demaine, John Iacono, Stefan Langerman