Sciweavers

2566 search results - page 129 / 514
» The Online Median Problem
Sort
View
COLT
2006
Springer
15 years 4 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
98
Voted
CORR
2010
Springer
86views Education» more  CORR 2010»
15 years 1 months ago
Online Scheduling on Identical Machines using SRPT
Due to its optimality on a single machine for the problem of minimizing average flow time, ShortestRemaining-Processing-Time (SRPT) appears to be the most natural algorithm to con...
Kyle Fox, Benjamin Moseley
126
Voted
CORR
2010
Springer
201views Education» more  CORR 2010»
14 years 10 months ago
Online Advertisement, Optimization and Stochastic Networks
In this paper, we propose a stochastic model to describe how search service providers charge client companies based on users' queries for the keywords related to these compan...
R. Srikant
ICCV
2007
IEEE
16 years 3 months ago
Scene Summarization for Online Image Collections
We formulate the problem of scene summarization as selecting a set of images that efficiently represents the visual content of a given scene. The ideal summary presents the most i...
Ian Simon, Noah Snavely, Steven M. Seitz
ICDE
2008
IEEE
195views Database» more  ICDE 2008»
16 years 2 months ago
LOCUST: An Online Analytical Processing Framework for High Dimensional Classification of Data Streams
Abstract-- In recent years, data streams have become ubiquitous because of advances in hardware and software technology. The ability to adapt conventional mining problems to data s...
Charu C. Aggarwal, Philip S. Yu