453 search results - page 54 / 91 » Tight bounds for the partial-sums problem |
112
Voted
ICC
2009
IEEE
15 years 7 months ago
2009
IEEE
—We consider a system with a single base station communicating with multiple users over orthogonal channels while being assisted by multiple relays. Several recent works have sug...
128
click to vote
CDC
2009
IEEE
15 years 4 months ago
2009
IEEE
This paper adresses the variance quantification problem for system identification based on the prediction error framework. The role of input and model class selection for the auto-...
103
Voted
NIPS
2004
15 years 2 months ago
2004
We study a method of optimal data-driven aggregation of classifiers in a convex combination and establish tight upper bounds on its excess risk with respect to a convex loss funct...
107
click to vote
CORR
2006
Springer
15 years 21 days ago
2006
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
116
Voted
TWC
2010
14 years 7 months ago
2010
Abstract-- This paper studies a statistical distribution of instantaneous power in pulse-shaped single-carrier (SC) modulation. Such knowledge is of significant importance to estim...