198 search results - page 25 / 40 » Weak Probabilistic Anonymity |
FOSSACS
2006
Springer
14 years 23 days ago
2006
Springer
In recent years, a tight connection has emerged between modal logic on the one hand and coalgebras, understood as generic transition systems, on the other hand. Here, we prove tha...
ICDCS
2006
IEEE
14 years 3 months ago
2006
IEEE
Publish/Subscribe systems provide a useful platform for delivering data (events) from publishers to subscribers in an anonymous fashion in distributed networks. In this paper, we ...
IPPS
2000
IEEE
14 years 1 months ago
2000
IEEE
A self-stabilizing algorithm, regardless of the initial system state, converges in finite time to a set of states that satisfy a legitimacy predicate without the need for explici...
DC
2007
13 years 9 months ago
2007
We present a randomizedself-stabilizing leaderelection protocol and a randomizedself-stabilizing token circulation protocol under an arbitrary scheduler on anonymous and unidirect...
RIAO
2007
2007
From Layout to Semantic: a Reranking Model for Mapping Web Documents to Mediated XML Representations
13 years 10 months ago
Many documents on the Web are formated in a weakly structured format. Because of their weak semantic and because of the heterogeneity of their formats, the information conveyed by...