92 search results - page 14 / 19 » On Maximal S-Free Convex Sets |
107
click to vote
INFOCOM
2011
IEEE
14 years 3 months ago
2011
IEEE
Abstract—In this paper, we investigate the problem of maximizing the throughput over a finite-horizon time period for a sensor network with energy replenishment. The finite-horiz...
CVPR
2010
IEEE
15 years 7 months ago
2010
IEEE
Online boosting is one of the most successful online learning algorithms in computer vision. While many challenging online learning problems are inherently multi-class, online boo...
HYBRID
2004
Springer
15 years 5 months ago
2004
Springer
The joint spectral radius of a set of matrices is a measure of the maximal asymptotic growth rate that can be obtained by forming long products of matrices taken from the set. This...
ECCC
2006
14 years 11 months ago
2006
We introduce a new algorithm and a new analysis technique that is applicable to a variety of online optimization scenarios, including regret minimization for Lipschitz regret func...
177
click to vote
INFOCOM
2006
IEEE
15 years 5 months ago
2006
IEEE
Abstract— This paper considers jointly optimal design of crosslayer congestion control, routing and scheduling for ad hoc wireless networks. We first formulate the rate constrai...