Sciweavers

333 search results - page 26 / 67
» A Unifying Framework for the Analysis of a Class of Euclidea...
Sort
View
COLT
2006
Springer
13 years 11 months ago
Logarithmic Regret Algorithms for Online Convex Optimization
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
Elad Hazan, Adam Kalai, Satyen Kale, Amit Agarwal
COLT
2008
Springer
13 years 9 months ago
Learning Coordinate Gradients with Multi-Task Kernels
Coordinate gradient learning is motivated by the problem of variable selection and determining variable covariation. In this paper we propose a novel unifying framework for coordi...
Yiming Ying, Colin Campbell
ECCV
2010
Springer
13 years 8 months ago
Semantic Segmentation of Urban Scenes Using Dense Depth Maps
In this paper we present a framework for semantic scene parsing and object recognition based on dense depth maps. Five viewindependent 3D features that vary with object class are e...
Chenxi Zhang, Liang Wang, Ruigang Yang
SCL
2011
13 years 2 months ago
Analysis of consensus protocols with bounded measurement errors
This paper analyzes two classes of consensus algorithms in presence of bounded measurement errors. The considered protocols adopt an updating rule based either on constant or vani...
Andrea Garulli, Antonio Giannitrapani
SIAMJO
2008
85views more  SIAMJO 2008»
13 years 7 months ago
Explicit Reformulations for Robust Optimization Problems with General Uncertainty Sets
We consider a rather general class of mathematical programming problems with data uncertainty, where the uncertainty set is represented by a system of convex inequalities. We prove...
Igor Averbakh, Yun-Bin Zhao