Sciweavers

220 search results - page 16 / 44
» Minimizing Average Flow-time : Upper and Lower Bounds
Sort
View
COLT
2004
Springer
13 years 10 months ago
Minimizing Regret with Label Efficient Prediction
We investigate label efficient prediction, a variant, proposed by Helmbold and Panizza, of the problem of prediction with expert advice. In this variant, the forecaster, after gues...
Nicolò Cesa-Bianchi, Gábor Lugosi, G...
JGAA
2006
127views more  JGAA 2006»
13 years 6 months ago
A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa,...
UAI
2003
13 years 8 months ago
Approximate Decomposition: A Method for Bounding and Estimating Probabilistic and Deterministic Queries
In this paper, we introduce a method for approximating the solution to inference and optimization tasks in uncertain and deterministic reasoning. Such tasks are in general intract...
David Larkin
ICASSP
2011
IEEE
12 years 10 months ago
Sum-rate maximization of two-way amplify-and-forward relay networks with imperfect channel state information
Considering a two-way amplify-and-forward (AF) relay network and aiming to simultaneously maximize the two users’ mutual information lower bounds in the presence of channel esti...
Yupeng Jia, Azadeh Vosoughi
CISS
2008
IEEE
14 years 1 months ago
On optimal training and beamforming in uncorrelated MIMO systems with feedback
—This paper studies the design and analysis of optimal training-based beamforming in uncorrelated multipleinput multiple-output (MIMO) channels with known Gaussian statistics. Fi...
Francisco Rubio, Dongning Guo, Michael L. Honig, X...