2924 search results - page 56 / 585 » Lower Bounds in Distributed Computing |
FLAIRS
1998
13 years 10 months ago
1998
In this paper wesuggest a wayof using the rules of System P to propagate lower bounds on conditional probabilities. Usinga knowledgebase of default rules whichart, consideredto be...
MFCS
2010
Springer
13 years 7 months ago
2010
Springer
In the context of modelling cryptographic tools like blind signatures and homomorphic encryption, the DolevYao model is typically extended with an operator over which encryption i...
ICCV
1998
IEEE
14 years 10 months ago
1998
IEEE
Proceedings of the 1998 IEEE International Conference on Computer Vision, Bombay, India We introduce a new distance between two distributions that we call the Earth Mover's D...
PODC
2006
ACM
14 years 2 months ago
2006
ACM
We study the implication that various timeliness and failure detector assumptions have on the performance of consensus algorithms that exploit them. We present a general framework...
STACS
2010
Springer
14 years 3 months ago
2010
Springer
The past decade has witnessed many interesting algorithms for maintaining statistics over a data stream. This paper initiates a theoretical study of algorithms for monitoring distr...