Sciweavers

1857 search results - page 173 / 372
» Minimum Degree Orderings
Sort
View
TIT
2010
160views Education» more  TIT 2010»
15 years 1 months ago
Bounds on the rate of 2-D bit-stuffing encoders
A method for bounding the rate of bit-stuffing encoders for 2-D constraints is presented. Instead of considering the original encoder, we consider a related one which is quasistati...
Ido Tal, Ron M. Roth
CORR
2011
Springer
184views Education» more  CORR 2011»
14 years 10 months ago
Resource CoAllocation for Scheduling Tasks with Dependencies, in Grid
Scheduling applications on wide-area distributed systems is useful for obtaining quick and reliable results in an efficient manner. Optimized scheduling algorithms are fundamental...
Diana Moise, Eliza Moise, Florin Pop, Valentin Cri...
ICASSP
2011
IEEE
14 years 10 months ago
Stochastic transceiver design in multi-antenna channels with statistical channel state information
The problem of stochastic robust sum mean square error (MSE) minimization transceiver design is addressed for multiple-input multiple-output (MIMO) broadcast channels (BCs). The t...
Andreas Gründinger, Michael Joham, Wolfgang U...
ICASSP
2011
IEEE
14 years 10 months ago
Global convergence of independent component analysis based on semidefinite programming relaxation
In the independent component analysis, polynomial functions of higher order statistics are often used as cost functions. However, such cost functions usually have many local minim...
Shotaro Akaho, Jun Fujiki
INFOCOM
2012
IEEE
13 years 9 months ago
Sparse recovery with graph constraints: Fundamental limits and measurement construction
—This paper addresses the problem of sparse recovery with graph constraints in the sense that we can take additive measurements over nodes only if they induce a connected subgrap...
Meng Wang, Weiyu Xu, Enrique Mallada, Ao Tang