In this paper we investigate algorithms and lower bounds for summarization problems over a single pass data stream. In particular we focus on histogram construction and K-center c...
Proximity based services are location based services (LBS) in which the service adaptation depends on the comparison between a given threshold value and the distance between a use...
Abstract— We study averaging algorithms, when implemented in large networks of wirelessly connected elements. We extend the notion of “Increasing Correctness” (IC) which was ...
Abstract. It is almost a folklore-knowledge that hash-based time-stamping schemes are secure if the underlying hash function is collisionresistant but still no rigorous proofs have...
In this paper, we extend Moss and Parikh’s approach to reasoning about topological properties of knowledge. We turn that system in a spatio-temporal direction by successively ad...