: In order to reduce transmission costs and response time, mobile clients typically cache data locally. But, avoiding the usage of outdated data and maintaining the consistency of ...
In this work we consider hierarchical clustering algorithms, such as UPGMA, which follow the closest-pair joining scheme. We survey optimal O(n2)-time implementations of such algo...
The study of the web as a graph is not only fascinating in its own right, but also yields valuable insight into web algorithms for crawling, searching and community discovery, and...
Andrei Z. Broder, Ravi Kumar, Farzin Maghoul, Prab...
2 Background Model Background subtraction algorithm is susceptible to both global and local illumination changes such as shadows, sunlight and reflection. These changes sometimes c...
In this paper we introduce the notion of weak endochrony, which extends to a synchronous setting the classical theory of Mazurkiewicz traces. The notion is useful in the synthesis ...