Search Results for author:
Found 2 papers, 0 papers with code
An Improved Algorithm For Online Min-Sum Set Cover
This is the first algorithm whose ratio does not depend on $n$: the previously best algorithm for this problem was $O(r^{3/2} \cdot \sqrt{n})$-competitive and $\Omega(r)$ is a lower bound on the performance of any deterministic online algorithm.
Improving Ads-Profitability Using Traffic-Fingerprints
This paper introduces the concept of traffic-fingerprints, i. e., normalized 24-dimensional vectors representing a distribution of daily traffic on a web page.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
