Sciweavers

2925 search results - page 49 / 585
» Information Complexity of Online Problems
Sort
View
CORR
2011
Springer
178views Education» more  CORR 2011»
14 years 9 months ago
Online Learning: Stochastic and Constrained Adversaries
Learning theory has largely focused on two main learning scenarios. The first is the classical statistical setting where instances are drawn i.i.d. from a fixed distribution and...
Alexander Rakhlin, Karthik Sridharan, Ambuj Tewari
150
Voted
WDAG
2009
Springer
166views Algorithms» more  WDAG 2009»
16 years 17 days ago
New Bounds for the Controller Problem
The (M, W)-controller, originally studied by Afek, Awerbuch, Plotkin, and Saks, is a basic ted tool that provides an abstraction for managing the consumption of a global resource ...
Yuval Emek, Amos Korman
CGO
2003
IEEE
15 years 11 months ago
Adaptive Online Context-Sensitive Inlining
As current trends in software development move toward more complex object-oriented programming, inlining has become a vital optimization that provides substantial performance impr...
Kim M. Hazelwood, David Grove
JUCS
2010
213views more  JUCS 2010»
15 years 4 months ago
Mining Feature-Opinion in Online Customer Reviews for Opinion Summarization
: Online customer reviews is considered as a significant informative resource which is useful for both potential customers and product manufacturers. In web pages, the reviews are ...
Gamgarn Somprasertsri, Pattarachai Lalitrojwong
209
Voted
COLT
2010
Springer
15 years 4 months ago
Optimal Algorithms for Online Convex Optimization with Multi-Point Bandit Feedback
Bandit convex optimization is a special case of online convex optimization with partial information. In this setting, a player attempts to minimize a sequence of adversarially gen...
Alekh Agarwal, Ofer Dekel, Lin Xiao