Online algorithm

Known as: Online algorithms, Offline algorithm, Online problem 
In computer science, an online algorithm is one that can only process its input piece-by-piece in a serial fashion, i.e., in the order that the input… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2016
Review
2016
In online scenarios requests arrive over time, and each request must be serviced in an irrevocable manner before the next request… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2015
Highly Cited
2015
We analyze stochastic gradient descent for optimizing nonconvex functions. In many cases for nonconvex functions the goal is to… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2009
Highly Cited
2009
In this paper we discuss an online algorithm based on policy iteration for learning the continuous-time (CT) optimal control… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
We consider the problem of learning to parse sentences to lambda-calculus representations of their underlying semantics and… (More)
  • figure 2
  • figure 3
  • table 1
  • table 3
Is this relevant?
Highly Cited
2005
Highly Cited
2005
In the classical secretary problem, a set S of numbers is presented to an online algorithm in random order. At any time the… (More)
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We present a family of margin based online learning algorith ms for various prediction tasks. In particular we derive and analyze… (More)
  • table 1
  • figure 2
Is this relevant?
Highly Cited
2003
Highly Cited
2003
This paper is concerned with the question of how to online combine an ensemble of active learners so as to expedite the learning… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • table 1
Is this relevant?
Highly Cited
2001
Highly Cited
2001
In this paper we study a paradigm to generalize online classi fication algorithms for binary classification problems to… (More)
  • figure 1
  • table 1
  • figure 7
  • figure 8
  • table 2
Is this relevant?
Highly Cited
2001
Highly Cited
2001
This paper discusses online power-aware routing in large wireless ad-hoc networks for applications where the message sequence is… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 6
Is this relevant?
Highly Cited
2001
Highly Cited
2001
An ∈-approximate quantile summary of a sequence of <i>N</i> elements is a data structure that can answer quantile queries about… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?