Sciweavers

6045 search results - page 272 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
DCC
2005
IEEE
15 years 9 months ago
On the Performance of Linear Slepian-Wolf Codes for Correlated Stationary Memoryless Sources
We derive an upper bound on the average MAP decoding error probability of random linear SW codes for arbitrary correlated stationary memoryless sources defined on Galois fields....
Shengtian Yang, Peiliang Qiu
ICML
2010
IEEE
15 years 8 months ago
Learning the Linear Dynamical System with ASOS
We develop a new algorithm, based on EM, for learning the Linear Dynamical System model. Called the method of Approximated Second-Order Statistics (ASOS) our approach achieves dra...
James Martens
EOR
2010
149views more  EOR 2010»
15 years 7 months ago
Adaptive multicut aggregation for two-stage stochastic linear programs with recourse
Outer linearization methods for two-stage stochastic linear programs with recourse, such as the L-shaped algorithm, generally apply a single optimality cut on the nonlinear object...
Svyatoslav Trukhanov, Lewis Ntaimo, Andrew Schaefe...
TC
2008
15 years 7 months ago
High-Performance Mixed-Precision Linear Solver for FPGAs
Compared to higher-precision data formats, lower-precision data formats result in higher performance for computationally intensive applications on FPGAs because of their lower res...
Junqing Sun, Gregory D. Peterson, Olaf O. Storaasl...
DAM
2008
102views more  DAM 2008»
15 years 7 months ago
On the computational complexity of partial covers of Theta graphs
By use of elementary geometric arguments we prove the existence of a special integral solution of a certain system of linear equations. The existence of such a solution yields the...
Jirí Fiala, Jan Kratochvíl, Attila P...