Sciweavers

441 search results - page 32 / 89
» Generic Timing Fault Tolerance using a Timely Computing Base
Sort
View
SIGOPS
2011
210views Hardware» more  SIGOPS 2011»
13 years 2 months ago
Small trusted primitives for dependable systems
Secure, fault-tolerant distributed systems are difficult to build, to validate, and to operate. Conservative design for such systems dictates that their security and fault toleran...
Petros Maniatis, Byung-Gon Chun
FDTC
2006
Springer
102views Cryptology» more  FDTC 2006»
13 years 11 months ago
Cryptographic Key Reliable Lifetimes: Bounding the Risk of Key Exposure in the Presence of Faults
With physical attacks threatening the security of current cryptographic schemes, no security policy can be developed without taking into account the physical nature of computation....
Alfonso De Gregorio
ENTCS
2006
185views more  ENTCS 2006»
13 years 7 months ago
Time Domain Verification of Oscillator Circuit Properties
The application of formal methods to analog and mixed signal circuits requires efficient methods tructing abstractions of circuit behaviors. This paper concerns the verification o...
Goran Frehse, Bruce H. Krogh, Rob A. Rutenbar, Ode...
ICC
2008
IEEE
135views Communications» more  ICC 2008»
14 years 2 months ago
Using Soft-Line Recursive Response to Improve Query Aggregation in Wireless Sensor Networks
— In large Wireless Sensor Networks (WSNs), each hop might incur varying delays due to medium access contention, transmission and computation delays. Fast and efficient query re...
Xiaoming Lu, Matt Spear, Karl N. Levitt, Norman S....
AFRIGRAPH
2007
ACM
13 years 11 months ago
Generic computation of bulletin boards into geometric kernels
Nowadays, many commercial CAD systems are built on proprietary geometric kernels which provide an API containing a set of high level geometric operations (boolean operations, slot...
Mehdi Baba-ali, David Marcheix, Xavier Skapin, Yve...