Sciweavers

1974 search results - page 296 / 395
» On Unbiased Linear Approximations
Sort
View
CORR
2007
Springer
99views Education» more  CORR 2007»
14 years 10 months ago
High Rate Single-Symbol ML Decodable Precoded DSTBCs for Cooperative Networks
—Distributed orthogonal space–time block codes (DOSTBCs) achieving full-diversity order and single-symbol maximum-likelihood (ML) decodability have been introduced recently by ...
Jagadeesh Harshan, B. Sundar Rajan
TSP
2008
101views more  TSP 2008»
14 years 9 months ago
Bayesian Compressive Sensing
The data of interest are assumed to be represented as N-dimensional real vectors, and these vectors are compressible in some linear basis B, implying that the signal can be recons...
Shihao Ji, Ya Xue, Lawrence Carin
ALGORITHMICA
2002
120views more  ALGORITHMICA 2002»
14 years 9 months ago
An Experimental Study of Algorithms for Weighted Completion Time Scheduling
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
Ivan D. Baev, Waleed Meleis, Alexandre E. Eichenbe...
TON
1998
90views more  TON 1998»
14 years 9 months ago
Effective bandwidths with priorities
—The notion of effective bandwidths has provided a useful practical framework for connection admission control and capacity planning in high-speed communication networks. The ass...
Arthur W. Berger, Ward Whitt
CORR
2011
Springer
243views Education» more  CORR 2011»
14 years 4 months ago
Deterministic Network Model Revisited: An Algebraic Network Coding Approach
Abstract—The capacity of multiuser networks has been a longstanding problem in information theory. Recently, Avestimehr et al. have proposed a deterministic network model to appr...
MinJi Kim, Elona Erez, Edmund M. Yeh, Muriel M&eac...