569 search results - page 43 / 114 » Online Bounds for Bayesian Algorithms |
SIGMOD
2001
ACM
15 years 10 months ago
2001
ACM
An -appro ximate quantile summary of a sequence of N elements is a data structure that can answer quantile queries about the sequence to within a precision of N. We presen t a new...
HICSS
1994
IEEE
15 years 2 months ago
1994
IEEE
We present a new distributed algorithm that detects and resolves communication deadlocks on-line, i.e., simultaneously detects and resolves deadlock as communication requests are ...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
In this paper, we study online algorithms when the input is not chosen adversarially, but consists of draws from some given probability distribution. While this model has been stu...
110
click to vote
ATAL
2011
Springer
13 years 10 months ago
2011
Springer
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
KDD
2004
ACM
15 years 10 months ago
2004
ACM
Extracting sentiments from unstructured text has emerged as an important problem in many disciplines. An accurate method would enable us, for example, to mine online opinions from ...