Sciweavers

3088 search results - page 25 / 618
» Online Passive-Aggressive Algorithms
Sort
View
SWAT
2004
Springer
125views Algorithms» more  SWAT 2004»
14 years 2 months ago
The Optimal Online Algorithms for Minimizing Maximum Lateness
It is well known that the Earliest-Deadline-First (EDF) and the Least-Laxity-First (LLF) algorithms are optimal algorithms for the problem of preemptively scheduling jobs that arr...
Patchrawat Uthaisombut
IPL
2000
111views more  IPL 2000»
13 years 8 months ago
On the performance of the first-fit coloring algorithm on permutation graphs
In this paper we study the performance of a particular on-line coloring algorithm, the First-Fit or Greedy algorithm, on a class of perfect graphs namely the permutation graphs. W...
Stavros D. Nikolopoulos, Charis Papadopoulos
SIGDOC
2010
ACM
13 years 7 months ago
A method for measuring helpfulness in online peer review
This paper describes an original method for evaluating peer review in online systems by calculating the helpfulness of an individual reviewer's response. We focus on the deve...
William Hart-Davidson, Michael McLeod, Christopher...
IVC
2010
128views more  IVC 2010»
13 years 7 months ago
Online kernel density estimation for interactive learning
In this paper we propose a Gaussian-kernel-based online kernel density estimation which can be used for applications of online probability density estimation and online learning. ...
Matej Kristan, Danijel Skocaj, Ales Leonardis
KDD
2012
ACM
212views Data Mining» more  KDD 2012»
11 years 11 months ago
eTrust: understanding trust evolution in an online world
Most existing research about online trust assumes static trust relations between users. As we are informed by social sciences, trust evolves as humans interact. Little work exists...
Jiliang Tang, Huan Liu, Huiji Gao, Atish Das Sarma...