Sciweavers

2610 search results - page 436 / 522
» Computational Probabilistic Non-interference
Sort
View
113
Voted
FOSSACS
2009
Springer
15 years 7 months ago
Bisimulation for Demonic Schedulers
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...
Konstantinos Chatzikokolakis, Gethin Norman, David...
92
Voted
PAKDD
2009
ACM
103views Data Mining» more  PAKDD 2009»
15 years 7 months ago
Hot Item Detection in Uncertain Data
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 ...
Thomas Bernecker, Hans-Peter Kriegel, Matthias Ren...
ICAS
2009
IEEE
147views Robotics» more  ICAS 2009»
15 years 7 months ago
Fast Estimation of Aggregates in Unstructured Networks
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...
Carlos Baquero, Paulo Sérgio Almeida, Raque...
RTCSA
2009
IEEE
15 years 7 months ago
Managing Imprecise Worst Case Execution Times on DVFS Platforms
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...
Vandy Berten, Chi-Ju Chang, Tei-Wei Kuo
94
Voted
INFOCOM
2009
IEEE
15 years 7 months ago
Using Failure Models for Controlling Data Availability in Wireless Sensor Networks
— 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...
Riccardo Crepaldi, Mirko Montanari, Indranil Gupta...