Sciweavers

170 search results - page 4 / 34
» A Bounding Quantifier
Sort
View
ICCAD
1995
IEEE
88views Hardware» more  ICCAD 1995»
13 years 9 months ago
Estimation and bounding of energy consumption in burst-mode control circuits
This paper describes two techniques to quantify energy consumption of burst-modeasynchronous(clock-less)controlcircuits. The circuit specifications consideredare extended burst-m...
Peter A. Beerel, Kenneth Y. Yun, Steven M. Nowick,...
FORTE
2008
13 years 7 months ago
An SMT Approach to Bounded Reachability Analysis of Model Programs
Model programs represent transition systems that are used fy expected behavior of systems at a high level of abstraction. The main application area is application-level network pro...
Margus Veanes, Nikolaj Bjørner, Alexander R...
ESORICS
2008
Springer
13 years 8 months ago
Formally Bounding the Side-Channel Leakage in Unknown-Message Attacks
Abstract. We propose a novel approach for quantifying a system's resistance to unknown-message side-channel attacks. The approach is based on a measure of the secret informati...
Michael Backes, Boris Köpf
ICASSP
2011
IEEE
12 years 9 months ago
Performance bounds for tracking in a multipath environment
Tracking in a multipath environment poses many challenges. It is worth while to quantify the achievable performance bounds in such an environment. However finding the performance...
Bentarage Sachintha Karunaratne, Mark R. Morelande...
ECCC
2008
65views more  ECCC 2008»
13 years 6 months ago
A Lower Bound on the Size of Series-Parallel Graphs Dense in Long Paths
One way to quantify how dense a multidag is in long paths is to find the largest n, m such that whichever n edges are removed, there is still a path from an original input to an ...
Chris Calabro