569 search results - page 57 / 114 » Online Bounds for Bayesian Algorithms |
SODA
2007
ACM
14 years 11 months ago
2007
ACM
We study a generalization of the classical secretary problem which we call the “matroid secretary problem”. In this problem, the elements of a matroid are presented to an onli...
100
click to vote
ESCAPE
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. In the online capacitated interval coloring problem, a sequence of requests arrive online. Each of the requests is an interval Ij ⊆ {1, 2, . . . , n} with bandwidth bj....
IPL
2000
14 years 9 months ago
2000
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...
WADS
2007
Springer
15 years 4 months ago
2007
Springer
The dynamic TCP acknowledgement problem formulated by Dooly et al. has been intensively studied in the area of competitive analysis. However, their framework does not consider the ...
PR
2000
14 years 9 months ago
2000
We propose a new technique for direct visual matching of images for the purposes of face recognition and image retrieval, using a probabilistic measure of similarity, based primar...