Recently, there have been a number of algorithms proposed for analyzing hypertext link structure so as to determine the best "authorities" for a given topic or query. Wh...
Allan Borodin, Gareth O. Roberts, Jeffrey S. Rosen...
In this paper we introduce a generalization of Paging to the case where there are many threads of requests. This models situations in which the requests come from more than one ind...
Esteban Feuerstein, Alejandro Strejilevich de Loma
In this paper, we address the problem of automatically detecting and tracking a variable number of persons in complex
scenes using a monocular, potentially moving, uncalibrated ca...
Michael D. Breitenstein, Fabian Reichlin, Bastian ...
Computational grids offer users a simple access to tremendous computer resources for solving large scale computing problems. Traditional performance analysis of scheduling algorit...
We consider the online problem of scheduling jobs with equal processing times on a single machine. Each job has a release time and a deadline, and the goal is to maximize the numb...