Sciweavers

835 search results - page 44 / 167
» Adaptive Bound Optimization for Online Convex Optimization
Sort
View
ICCV
2011
IEEE
12 years 10 months ago
Tight Convex Relaxations for Vector-Valued Labeling Problems
The multi-label problem is of fundamental importance to computer vision, yet finding global minima of the associated energies is very hard and usually impossible in practice. Rec...
Evgeny Strekalovskiy, Bastian Goldluecke, Daniel C...
IJSYSC
2010
92views more  IJSYSC 2010»
13 years 9 months ago
Constrained optimal control: an application to semiactive suspension systems
This paper applies three different control techniques to the design of a quarter car semiactive suspension system. The three techniques, originally developed to solve a constrain...
Tina Paschedag, Alessandro Giua, Carla Seatzu
COCOON
2006
Springer
14 years 2 months ago
On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis
We study the dynamic bin packing problem introduced by Coffman, Garey and Johnson. This problem is a generalization of the bin packing problem in which items may arrive and depart...
Wun-Tat Chan, Prudence W. H. Wong, Fencol C. C. Yu...
ML
2007
ACM
131views Machine Learning» more  ML 2007»
13 years 10 months ago
A primal-dual perspective of online learning algorithms
We describe a novel framework for the design and analysis of online learning algorithms based on the notion of duality in constrained optimization. We cast a sub-family of universa...
Shai Shalev-Shwartz, Yoram Singer
INFOCOM
2011
IEEE
13 years 2 months ago
Finite-horizon energy allocation and routing scheme in rechargeable sensor networks
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...
Shengbo Chen, Prasun Sinha, Ness B. Shroff, Changh...