Sciweavers

835 search results - page 76 / 167
» Adaptive Bound Optimization for Online Convex Optimization
Sort
View
ICALP
2007
Springer
15 years 1 months ago
Online Conflict-Free Colorings for Hypergraphs
We provide a framework for online conflict-free coloring (CF-coloring) of any hypergraph. We use this framework to obtain an efficient randomized online algorithm for CF-coloring ...
Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olon...
CVPR
2009
IEEE
16 years 4 months ago
Vocabulary Hierarchy Optimization for Effective and Transferable Retrieval
Scalable image retrieval systems usually involve hierarchical quantization of local image descriptors, which produces a visual vocabulary for inverted indexing of images. Although ...
Rongrong Ji (Harbin Institute of Technology), Xing...
ICRA
2010
IEEE
130views Robotics» more  ICRA 2010»
14 years 8 months ago
A distributed strategy for gait adaptation in modular robots
Abstract— In this paper we study online gait optimization for modular robots. The learning strategy we apply is distributed, independent on robot morphology, and easy to implemen...
David Johan Christensen, Ulrik Pagh Schultz, Kaspe...
ICC
2007
IEEE
161views Communications» more  ICC 2007»
15 years 4 months ago
Optimizing Multiplayer Gaming Protocols for Heterogeneous Network Environment
— The paper is concerned with a novel adaptive game server protocol optimization to combat network latencies in the case of heterogeneous network environment. In this way, game p...
Zsolt Kenesi, Gábor Kiss, János Leve...
CISS
2008
IEEE
15 years 4 months ago
Subgradient methods in network resource allocation: Rate analysis
— We consider dual subgradient methods for solving (nonsmooth) convex constrained optimization problems. Our focus is on generating approximate primal solutions with performance ...
Angelia Nedic, Asuman E. Ozdaglar