UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling

IEEE transactions on automatic control, 2012-03, Vol.57 (3), p.592-606

2012

Volltextzugriff (PDF)

Information-Theoretic Limits on Sparsity Recovery in the High-Dimensional and Noisy Setting

IEEE transactions on information theory, 2009-12, Vol.55 (12), p.5728-5741

Wainwright, M.J.

2009

Volltextzugriff (PDF)

Information-Theoretic Lower Bounds on the Oracle Complexity of Stochastic Convex Optimization

IEEE transactions on information theory, 2012-05, Vol.58 (5), p.3235-3249

2012

Volltextzugriff (PDF)

Visual adaptation as optimal information transmission

Vision research (Oxford), 1999-11, Vol.39 (23), p.3960-3974

Wainwright, Martin J.

1999

Volltextzugriff (PDF)

Image denoising using scale mixtures of Gaussians in the wavelet domain

IEEE transactions on image processing, 2003-11, Vol.12 (11), p.1338-1351

2003

Volltextzugriff (PDF)

Using linear programming to Decode Binary linear codes

IEEE transactions on information theory, 2005-03, Vol.51 (3), p.954-972

2005

Volltextzugriff (PDF)

MAP estimation via agreement on trees: message-passing and linear programming

IEEE transactions on information theory, 2005-11, Vol.51 (11), p.3697-3717

2005

Volltextzugriff (PDF)

Stochastic Belief Propagation: A Low-Complexity Alternative to the Sum-Product Algorithm

IEEE transactions on information theory, 2013-04, Vol.59 (4), p.1981-2000

2013

Volltextzugriff (PDF)

Geographic Gossip: Efficient Averaging for Sensor Networks

IEEE transactions on signal processing, 2008-03, Vol.56 (3), p.1205-1216

2008

Volltextzugriff (PDF)

A new class of upper bounds on the log partition function

IEEE transactions on information theory, 2005-07, Vol.51 (7), p.2313-2335

2005

Volltextzugriff (PDF)

Low-Density Graph Codes That Are Optimal for Binning and Coding With Side Information

IEEE transactions on information theory, 2009-03, Vol.55 (3), p.1061-1079

2009

Volltextzugriff (PDF)

Log-determinant relaxation for approximate inference in discrete Markov random fields

IEEE transactions on signal processing, 2006-06, Vol.54 (6), p.2099-2109

2006

Volltextzugriff (PDF)

Network Coding for Distributed Storage Systems

IEEE transactions on information theory, 2010-09, Vol.56 (9), p.4539-4551

2010

Volltextzugriff (PDF)

LP Decoding Corrects a Constant Fraction of Errors

IEEE transactions on information theory, 2007-01, Vol.53 (1), p.82-89

2007

Volltextzugriff (PDF)

Information-Theoretic Limits of Selecting Binary Graphical Models in High Dimensions

IEEE transactions on information theory, 2012-07, Vol.58 (7), p.4117-4134

2012

Volltextzugriff (PDF)

Probabilistic Analysis of Linear Programming Decoding

IEEE transactions on information theory, 2008-08, Vol.54 (8), p.3565-3578

2008

Volltextzugriff (PDF)

Nonparametric decentralized detection using kernel methods

IEEE transactions on signal processing, 2005-11, Vol.53 (11), p.4053-4066

2005

Volltextzugriff (PDF)

Guessing Facets: Polytope Structure and Improved LP Decoder

IEEE transactions on information theory, 2009-08, Vol.55 (8), p.3479-3487

2009

Volltextzugriff (PDF)

Convergence Analysis of Reweighted Sum-Product Algorithms

IEEE transactions on signal processing, 2008-09, Vol.56 (9), p.4293-4305

2008

Volltextzugriff (PDF)

Analysis of Absorbing Sets and Fully Absorbing Sets of Array-Based LDPC Codes

IEEE transactions on information theory, 2010-01, Vol.56 (1), p.181-201

2010

Volltextzugriff (PDF)

Randomized Sketches of Convex Programs With Sharp Guarantees

IEEE transactions on information theory, 2015-09, Vol.61 (9), p.5096-5115

2015

Volltextzugriff (PDF)

Estimating Divergence Functionals and the Likelihood Ratio by Convex Risk Minimization

IEEE transactions on information theory, 2010-11, Vol.56 (11), p.5847-5861

2010

Volltextzugriff (PDF)

Optimal Rates for Zero-Order Convex Optimization: The Power of Two Function Evaluations

IEEE transactions on information theory, 2015-05, Vol.61 (5), p.2788-2806

2015

Volltextzugriff (PDF)

Network-Based Consensus Averaging With General Noisy Channels

IEEE transactions on signal processing, 2011-01, Vol.59 (1), p.373-385

2011

Volltextzugriff (PDF)

Embedded trees: estimation of Gaussian Processes on graphs with cycles

IEEE transactions on signal processing, 2004-11, Vol.52 (11), p.3136-3150

2004

Volltextzugriff (PDF)

1 – 25 von 1.312

Menü

Weitere Dienste

Einstellungen

Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling

Information-Theoretic Limits on Sparsity Recovery in the High-Dimensional and Noisy Setting

Information-Theoretic Lower Bounds on the Oracle Complexity of Stochastic Convex Optimization

Visual adaptation as optimal information transmission

Image denoising using scale mixtures of Gaussians in the wavelet domain

Using linear programming to Decode Binary linear codes

MAP estimation via agreement on trees: message-passing and linear programming

Stochastic Belief Propagation: A Low-Complexity Alternative to the Sum-Product Algorithm

Geographic Gossip: Efficient Averaging for Sensor Networks

A new class of upper bounds on the log partition function

Low-Density Graph Codes That Are Optimal for Binning and Coding With Side Information

Log-determinant relaxation for approximate inference in discrete Markov random fields

Network Coding for Distributed Storage Systems

LP Decoding Corrects a Constant Fraction of Errors

Information-Theoretic Limits of Selecting Binary Graphical Models in High Dimensions

Probabilistic Analysis of Linear Programming Decoding

Nonparametric decentralized detection using kernel methods

Guessing Facets: Polytope Structure and Improved LP Decoder

Convergence Analysis of Reweighted Sum-Product Algorithms

Analysis of Absorbing Sets and Fully Absorbing Sets of Array-Based LDPC Codes

Randomized Sketches of Convex Programs With Sharp Guarantees

Estimating Divergence Functionals and the Likelihood Ratio by Convex Risk Minimization

Optimal Rates for Zero-Order Convex Optimization: The Power of Two Function Evaluations

Network-Based Consensus Averaging With General Noisy Channels

Embedded trees: estimation of Gaussian Processes on graphs with cycles

Suchergebnisse filtern