Sciweavers

478 search results - page 76 / 96
» Convexity minimizes pseudo-triangulations
Sort
View
TIT
2008
109views more  TIT 2008»
13 years 8 months ago
Statistical Analysis of Bayes Optimal Subset Ranking
Abstract--The ranking problem has become increasingly important in modern applications of statistical methods in automated decision making systems. In particular, we consider a for...
David Cossock, Tong Zhang
ICASSP
2008
IEEE
14 years 2 months ago
Sparse reconstruction by separable approximation
Finding sparse approximate solutions to large underdetermined linear systems of equations is a common problem in signal/image processing and statistics. Basis pursuit, the least a...
Stephen J. Wright, Robert D. Nowak, Mário A...
ICC
2007
IEEE
104views Communications» more  ICC 2007»
14 years 2 months ago
Joint Design of Tx-Rx Beamformers in MIMO Downlink Channel
We consider a single-cell multiple-input multiple-output (MIMO) downlink channel where linear transmission and reception strategy is employed. The base station (BS) transmitter is...
Marian Codreanu, Antti Tölli, Markku J. Juntt...
IMC
2007
ACM
13 years 9 months ago
On optimal probing for delay and loss measurement
Packet delay and loss are two fundamental measures of performance. Using active probing to measure delay and loss typically involves sending Poisson probes, on the basis of the PA...
François Baccelli, Sridhar Machiraju, Darry...
COLT
1999
Springer
14 years 10 days ago
Regret Bounds for Prediction Problems
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
Geoffrey J. Gordon