Sciweavers

1510 search results - page 41 / 302
» Upper Probabilities and Additivity
Sort
View
ISLPED
1998
ACM
94views Hardware» more  ISLPED 1998»
14 years 3 months ago
Theoretical bounds for switching activity analysis in finite-state machines
- The objective of this paper is to provide lower and upper bounds for the switching activity on the state lines in Finite State Machines (FSMs). Using a Markov chain model for the...
Diana Marculescu, Radu Marculescu, Massoud Pedram
ASPDAC
2001
ACM
86views Hardware» more  ASPDAC 2001»
14 years 2 months ago
Development of PPRAM-link interface (PLIF) IP core for high-speed inter-SoC communication
Abstract-- We are proposing "PPRAM-Link": a new highspeed communication standard for merged-DRAM/logic SoC architecture. PPRAM-Link standard is composed of physical/logic...
Takanori Okuma, Koji Hashimoto, Kazuaki Murakami
CONCUR
2001
Springer
14 years 3 months ago
Symbolic Computation of Maximal Probabilistic Reachability
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...
Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sprost...
FSTTCS
2010
Springer
13 years 9 months ago
Lower bounds for Quantum Oblivious Transfer
Oblivious transfer is a fundamental primitive in cryptography. While perfect information theoretic security is impossible, quantum oblivious transfer protocols can limit the disho...
André Chailloux, Iordanis Kerenidis, Jamie ...
ICASSP
2008
IEEE
14 years 5 months ago
Performance characteristics of collaborative beamforming for wireless sensor networks with Gaussian distributed sensor nodes
Collaborative beamforming has been recently introduced in the context of wireless sensor networks (WSNs) to increase the transmission range of individual sensor nodes. In this pap...
Mohammed F. A. Ahmed, Sergiy A. Vorobyov