Sciweavers

39 search results - page 3 / 8
» On the Power of Positive Turing Reductions
Sort
View
ATVA
2006
Springer
160views Hardware» more  ATVA 2006»
13 years 11 months ago
Monotonic Set-Extended Prefix Rewriting and Verification of Recursive Ping-Pong Protocols
Ping-pong protocols with recursive definitions of agents, but without any active intruder, are a Turing powerful model. We show that under the environment sensitive semantics (i.e....
Giorgio Delzanno, Javier Esparza, Jirí Srba
CSDA
2008
102views more  CSDA 2008»
13 years 7 months ago
Step-up and step-down procedures controlling the number and proportion of false positives
In multiple hypotheses testing, it is important to control the probability of rejecting "true" null hypotheses. A standard procedure has been to control the family-wise ...
Paul N. Somerville, Claudia Hemmelmann
IM
2007
13 years 7 months ago
Using the Power of Two Choices to Improve Bloom Filters
We consider the combination of two ideas from the hashing literature: the power of two choices and Bloom filters. Specifically, we show via simulations that, in comparison with a...
Steven S. Lumetta, Michael Mitzenmacher
ISLPED
2005
ACM
111views Hardware» more  ISLPED 2005»
14 years 1 months ago
Peak temperature control and leakage reduction during binding in high level synthesis
Temperature is becoming a first rate design criterion in ASICs due to its negative impact on leakage power, reliability, performance, and packaging cost. Incorporating awareness o...
Rajarshi Mukherjee, Seda Ogrenci Memik, Gokhan Mem...
MCU
2004
126views Hardware» more  MCU 2004»
13 years 8 months ago
Universality and Cellular Automata
The classification of discrete dynamical systems that are computationally complete has recently drawn attention in light of Wolfram's "Principle of Computational Equivale...
Klaus Sutner