233 search results - page 3 / 47 » Semantical Counting Circuits |
LICS
1999
IEEE
13 years 11 months ago
1999
IEEE
An important open question in complexity theory is whether the circuit complexity class TC0 is (strictly) weaker than LOGSPACE. This paper considers this question from the viewpoi...
AMSTERDAM
2009
13 years 5 months ago
2009
This paper offers an account of the semantics of count nous. I show that neither the atomic/nonatomic distinction nor the homogeneous/non-homogeneous distinction is sufficient to ...
FPL
2003
Springer
14 years 19 days ago
2003
Springer
Abstract. Data dependent circuits are logic circuits specialized to specific input data. They are smaller and faster than the original circuits, although they are not reusable and...
DAC
2005
ACM
14 years 8 months ago
2005
ACM
We demonstrate how to use placement to ameliorate the predicted repeater explosion problem caused by poor interconnect scaling. We achieve repeater count reduction by dynamically ...
ISIPTA
2005
IEEE
14 years 1 months ago
2005
IEEE
The main goal of this paper is to describe a new semantic for conditional independence in terms of no double counting of uncertain evidence. For ease of exposition, we use probabi...