Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2017
Review
2017
In an increasingly networked world in which information is becoming increasingly actual, how can a system know with certainty… Expand
  • figure 2.1
  • figure 2.2
  • figure 2.3
  • figure 3.1
  • figure 3.2
Is this relevant?
Highly Cited
2009
Highly Cited
2009
In this paper, we address the problem of learning an adaptive appearance model for object tracking. In particular, a class of… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Online learning is the process of answering a sequence of questions given knowledge of the correct answers to previous questions… Expand
  • figure 1.1
  • table 1.1
  • figure 2.1
  • figure 3.1
  • figure 3.2
Is this relevant?
Highly Cited
2007
Highly Cited
2007
We study the online ad-auctions problem introduced by Mehta et al. [15]. We design a (1 - 1/e)-competitive (optimal) algorithm… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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… Expand
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • table 1
Is this relevant?
Highly Cited
2003
Highly Cited
2003
In this paper we study a paradigm to generalize online classification algorithms for binary classification problems to multiclass… Expand
Is this relevant?
Highly Cited
2003
Highly Cited
2003
In this paper we study online classification algorithms for multiclass problems in the mistake bound model. The hypotheses we use… Expand
  • figure 1
  • table 1
  • figure 7
  • figure 8
  • table 2
Is this relevant?
Highly Cited
2003
Highly Cited
2003
In an online decision problem, one makes a sequence of decisions without knowledge of the future. Tools from learning such as… Expand
  • figure 1
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Skyline queries ask for a set of interesting points from a potentially large set of data points. If we are traveling, for… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • table 1
Is this relevant?