37 search results - page 6 / 8 » Toward a general theory of names: binding and scope |
95
Voted
SIAMCOMP
1998
14 years 9 months ago
1998
We initiate an investigation of general fault-tolerant distributed computation in the full-information model. In the full information model no restrictions are made on the computat...
EDBT
2009
ACM
15 years 4 months ago
2009
ACM
Privacy models such as k-anonymity and -diversity typically offer an aggregate or scalar notion of the privacy property that holds collectively on the entire anonymized data set....
CIKM
2009
Springer
15 years 4 months ago
2009
Springer
With the ubiquity of information networks and their broad applications, the issue of similarity computation between entities of an information network arises and draws extensive r...
ENTCS
2002
14 years 9 months ago
2002
In this paper we propose a new equivalence relation for dynamical and control systems called bisimulation. As the name implies this definition is inspired by the fundamental notio...
106
click to vote
INFOCOM
2012
IEEE
12 years 12 months ago
2012
IEEE
—Traditional approaches for wireless sensor network diagnosis are mainly sink-based. They actively collect global evidences from sensor nodes to the sink so as to conduct central...