Sciweavers

2126 search results - page 72 / 426
» An optimization algorithm for imprecise multi-objective prob...
Sort
View
ICIP
2006
IEEE
16 years 6 months ago
Sparse Image Reconstruction for Partially known Blur Functions
In this paper, we consider the problem of image reconstruction from the noisy blurred version of an original image when the blurring operator is partially known and the original i...
Raviv Raich, Alfred O. Hero
ICDAR
2011
IEEE
14 years 4 months ago
Tuning between Exponential Functions and Zones for Membership Functions Selection in Voronoi-Based Zoning for Handwritten Charac
— In Handwritten Character Recognition, zoning is rigtly considered as one of the most effective feature extraction techniques. In the past, many zoning methods have been propose...
Sebastiano Impedovo, Giuseppe Pirlo
NIPS
2004
15 years 5 months ago
Nearly Tight Bounds for the Continuum-Armed Bandit Problem
In the multi-armed bandit problem, an online algorithm must choose from a set of strategies in a sequence of n trials so as to minimize the total cost of the chosen strategies. Wh...
Robert D. Kleinberg
JMLR
2010
125views more  JMLR 2010»
14 years 11 months ago
Regret Bounds for Gaussian Process Bandit Problems
Bandit algorithms are concerned with trading exploration with exploitation where a number of options are available but we can only learn their quality by experimenting with them. ...
Steffen Grünewälder, Jean-Yves Audibert,...
INFOCOM
2012
IEEE
13 years 6 months ago
Delay and rate-optimal control in a multi-class priority queue with adjustable service rates
—We study two convex optimization problems in a multi-class M/G/1 queue with adjustable service rates: minimizing convex functions of the average delay vector, and minimizing ave...
Chih-Ping Li, Michael J. Neely