Sciweavers

835 search results - page 5 / 167
» Adaptive Bound Optimization for Online Convex Optimization
Sort
View
MP
2010
162views more  MP 2010»
13 years 6 months ago
Approximation accuracy, gradient methods, and error bound for structured convex optimization
Convex optimization problems arising in applications, possibly as approximations of intractable problems, are often structured and large scale. When the data are noisy, it is of i...
Paul Tseng
PG
2003
IEEE
14 years 28 days ago
Bounding Recursive Procedural Models Using Convex Optimization
We present an algorithm to construct a tight bounding polyhedron for a recursive procedural model. We first use an iterated function system (IFS) to represent the extent of the p...
Orion Sky Lawlor, John C. Hart
CVPR
2012
IEEE
11 years 10 months ago
Online robust image alignment via iterative convex optimization
In this paper we study the problem of online aligning a newly arrived image to previously well-aligned images. Inspired by recent advances in batch image alignment using low rank ...
Yi Wu, Bin Shen, Haibin Ling
EUROPAR
2006
Springer
13 years 11 months ago
On-Line Adaptive Parallel Prefix Computation
Abstract. We consider parallel prefix computation on processors of different and possibly changing speeds. Extending previous works on identical processors, we provide a lower boun...
Jean-Louis Roch, Daouda Traoré, Julien Bern...
COLT
2010
Springer
13 years 5 months ago
Hedging Structured Concepts
We develop an online algorithm called Component Hedge for learning structured concept classes when the loss of a structured concept sums over its components. Example classes inclu...
Wouter M. Koolen, Manfred K. Warmuth, Jyrki Kivine...