Sciweavers

13457 search results - page 122 / 2692
» Can we elect if we cannot compare
Sort
View
SP
2003
IEEE
107views Security Privacy» more  SP 2003»
14 years 2 months ago
Anomaly Detection Using Call Stack Information
The call stack of a program execution can be a very good information source for intrusion detection. There is no prior work on dynamically extracting information from call stack a...
Henry Hanping Feng, Oleg M. Kolesnikov, Prahlad Fo...
CARDIS
2008
Springer
113views Hardware» more  CARDIS 2008»
13 years 11 months ago
The Trusted Execution Module: Commodity General-Purpose Trusted Computing
This paper introduces the Trusted Execution Module (TEM); a high-level specification for a commodity chip that can execute usersupplied procedures in a trusted environment. The TEM...
Victor Costan, Luis F. G. Sarmenta, Marten van Dij...
QEST
2010
IEEE
13 years 7 months ago
Reasoning about MDPs as Transformers of Probability Distributions
We consider Markov Decision Processes (MDPs) as transformers on probability distributions, where with respect to a scheduler that resolves nondeterminism, the MDP can be seen as ex...
Vijay Anand Korthikanti, Mahesh Viswanathan, Gul A...
ADHOC
2007
139views more  ADHOC 2007»
13 years 9 months ago
Bounded-distance multi-clusterhead formation in wireless ad hoc networks
We present a clustering technique addressing redundancy for bounded-distance clusters, which means being able to determine the minimum number of cluster-heads per node, and the ma...
Marco Aurélio Spohn, J. J. Garcia-Luna-Acev...
HPDC
2002
IEEE
14 years 2 months ago
A Decentralized, Adaptive Replica Location Mechanism
We describe a decentralized, adaptive mechanism for replica location in wide-area distributed systems. Unlike traditional, hierarchical (e.g, DNS) and more recent (e.g., CAN, Chor...
Matei Ripeanu, Ian T. Foster