Sciweavers

974 search results - page 100 / 195
» Formal Modeling of Communication Traces
Sort
View
ICML
2002
IEEE
16 years 15 days ago
Learning to Share Distributed Probabilistic Beliefs
In this paper, we present a general machine learning approach to the problem of deciding when to share probabilistic beliefs between agents for distributed monitoring. Our approac...
Christopher Leckie, Kotagiri Ramamohanarao
GLOBECOM
2006
IEEE
15 years 5 months ago
Defending against Instant Messaging Worms
— Due to the real time nature and buddy list presence information of Instant Messaging (IM) systems worms can spread over IM networks rapidly, causing severe damages, however, it...
Zhijun Liu, Guoqiang Shu, Na Li, David Lee
IFIP
2004
Springer
15 years 5 months ago
Decidability of Opacity with Non-Atomic Keys
The most studied property, secrecy, is not always sufficient to prove the security of a protocol. Other properties such as anonymity, privacy or opacity could be useful. Here, we u...
Laurent Mazaré
ACSC
2003
IEEE
15 years 5 months ago
Policies for Sharing Distributed Probabilistic Beliefs
In this paper, we present several general policies for deciding when to share probabilistic beliefs between agents for distributed monitoring. In order to evaluate these policies,...
Christopher Leckie, Kotagiri Ramamohanarao
DEXAW
2004
IEEE
80views Database» more  DEXAW 2004»
15 years 3 months ago
Traceable Document Flows
Ad-hoc data exchange, e.g., by sending email attachments, leads to multiple copies or versions of a document at dispersed nodes in a network. However, their relationships such as ...
Martin Bernauer, Gerti Kappel, Elke Michlmayr