Sciweavers

2468 search results - page 156 / 494
» On Model Checking Techniques for Randomized Distributed Syst...
Sort
View
FORTE
2003
15 years 5 months ago
A Lightweight Formal Analysis of a Multicast Key Management Scheme
Abstract. This paper describes the analysis of Pull-Based Asynchronous Rekeying Framework (ARF), a recently proposed solution to the scalable group key management problem in secure...
Mana Taghdiri, Daniel Jackson
KDD
2009
ACM
305views Data Mining» more  KDD 2009»
16 years 4 months ago
Grocery shopping recommendations based on basket-sensitive random walk
We describe a recommender system in the domain of grocery shopping. While recommender systems have been widely studied, this is mostly in relation to leisure products (e.g. movies...
Ming Li, M. Benjamin Dias, Ian H. Jarman, Wael El-...
ICTAC
2005
Springer
15 years 9 months ago
Stochastic Analysis of Graph Transformation Systems: A Case Study in P2P Networks
In distributed and mobile systems with volatile bandwidth and fragile connectivity, non-functional aspects like performance and reliability become more and more important. To forma...
Reiko Heckel
CVPR
2006
IEEE
16 years 5 months ago
The Layout Consistent Random Field for Recognizing and Segmenting Partially Occluded Objects
This paper addresses the problem of detecting and segmenting partially occluded objects of a known category. We first define a part labelling which densely covers the object. Our ...
John M. Winn, Jamie Shotton
130
Voted
SIROCCO
2008
15 years 5 months ago
Sharpness: A Tight Condition for Scalability
: A distributed system is scalable if the rate at which it completes its computation and communication tasks does not depend on its size. As an example, the scalability of a peer-t...
Augustin Chaintreau