Sciweavers

5084 search results - page 64 / 1017
» Proving Possibility Properties
Sort
View
ICDT
2009
ACM
148views Database» more  ICDT 2009»
14 years 10 months ago
Tight results for clustering and summarizing data streams
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...
Sudipto Guha
MDM
2009
Springer
102views Communications» more  MDM 2009»
14 years 4 months ago
Privacy-Aware Proximity Based Services
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...
Sergio Mascetti, Claudio Bettini, Dario Freni, Xia...
CDC
2008
IEEE
137views Control Systems» more  CDC 2008»
14 years 4 months ago
Increasingly correct message passing averaging algorithms
Abstract— We study averaging algorithms, when implemented in large networks of wirelessly connected elements. We extend the notion of “Increasing Correctness” (IC) which was ...
Kurt Plarre, Francesco Bullo
ASIACRYPT
2004
Springer
14 years 3 months ago
On Provably Secure Time-Stamping Schemes
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...
Ahto Buldas, Märt Saarepera
FLAIRS
2007
14 years 9 days ago
Some Spatial and Spatio-Temporal Operators Derived from the Topological View of Knowledge
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...
Bernhard Heinemann