2610 search results - page 436 / 522 » Computational Probabilistic Non-interference |
134
Voted
FOSSACS
2009
Springer
15 years 10 months ago
2009
Springer
Bisimulation between processes has been proven a successful method for formalizing security properties. We argue that in certain cases, a scheduler that has full information on the...
111
click to vote
PAKDD
2009
ACM
15 years 10 months ago
2009
ACM
Abstract. An object o of a database D is called a hot item, if there is a sufficiently large population of other objects in D that are similar to o. In other words, hot items are ...
149
click to vote
ICAS
2009
IEEE
15 years 10 months ago
2009
IEEE
Aggregation of data values plays an important role on distributed computations, in particular over peer-to-peer and sensor networks, as it can provide a summary of some global sys...
131
click to vote
RTCSA
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract—Although energy-efficient real-time task scheduling has attracted a lot of attention in the past decade, most existing results assumed deterministic execution lengths f...
117
click to vote
INFOCOM
2009
IEEE
15 years 9 months ago
2009
IEEE
— This paper presents Pirrus, a replica management system that addresses the problem of providing data availability on a wireless sensor network. Pirrus uses probabilistic failur...