Sciweavers

1429 search results - page 104 / 286
» The Complexity of the Approximation of the Bandwidth Problem
Sort
View
CORR
2012
Springer
170views Education» more  CORR 2012»
13 years 12 months ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson
SIAMSC
2008
179views more  SIAMSC 2008»
15 years 4 months ago
Multigrid Algorithms for Inverse Problems with Linear Parabolic PDE Constraints
Abstract. We present a multigrid algorithm for the solution of distributed parameter inverse problems constrained by variable-coefficient linear parabolic partial differential equa...
Santi S. Adavani, George Biros
TIT
2010
115views Education» more  TIT 2010»
14 years 11 months ago
On resource allocation in fading multiple-access channels-an efficient approximate projection approach
We consider the problem of rate and power allocation in a multiple-access channel. Our objective is to obtain rate and power allocation policies that maximize a general concave ut...
Ali ParandehGheibi, Atilla Eryilmaz, Asuman E. Ozd...
INFOCOM
2000
IEEE
15 years 8 months ago
Network Border Patrol
Abstract—The end-to-end nature of Internet congestion control is an important factor in its scalability and robustness. However, end-to-end congestion control algorithms alone ar...
Célio Albuquerque, Brett J. Vickers, Tatsuy...
CORR
2011
Springer
191views Education» more  CORR 2011»
14 years 11 months ago
A Message-Passing Receiver for BICM-OFDM over Unknown Clustered-Sparse Channels
We propose a factor-graph-based approach to joint channel-estimationand-decoding of bit-interleaved coded orthogonal frequency division multiplexing (BICM-OFDM). In contrast to ex...
Philip Schniter