Sciweavers

107 search results - page 15 / 22
» Computing subsets of equivalence classes for large FSMs
Sort
View
DAC
1994
ACM
13 years 10 months ago
Automatic Verification of Pipelined Microprocessors
Abstract - We address the problem of automatically verifying large digital designs at the logic level, against high-level specifications. In this paper, we present a methodology wh...
Vishal Bhagwati, Srinivas Devadas
ICIP
2010
IEEE
13 years 4 months ago
Distributed classification of multiple observations by consensus
We consider the problem of distributed classification of multiple observations of the same object that are collected in an ad-hoc network of vision sensors. Assuming that each sen...
Effrosini Kokiopoulou, Pascal Frossard
IISWC
2009
IEEE
14 years 1 months ago
On the (dis)similarity of transactional memory workloads
— Programming to exploit the resources in a multicore system remains a major obstacle for both computer and software engineers. Transactional memory offers an attractive alternat...
Clay Hughes, James Poe, Amer Qouneh, Tao Li
JOC
2008
86views more  JOC 2008»
13 years 6 months ago
Lower Bounds and Impossibility Results for Concurrent Self Composition
In the setting of concurrent self composition, a single protocol is executed many times concurrently by a single set of parties. In this paper, we prove lower bounds and impossibi...
Yehuda Lindell
FOCS
2007
IEEE
14 years 1 months ago
Polylogarithmic Independence Can Fool DNF Formulas
We show that any k-wise independent probability distribution on {0, 1}n O(m2.22− √ k/10)fools any boolean function computable by an m-clause DNF (or CNF) formula on n variable...
Louay Bazzi