Sciweavers

1117 search results - page 2 / 224
» Equivalent Representations of Set Functions
Sort
View
TCAD
2008
93views more  TCAD 2008»
13 years 5 months ago
Transforming Cyclic Circuits Into Acyclic Equivalents
Abstract--Designers and high-level synthesis tools can introduce unwanted cycles in digital circuits, and for certain combinational functions, cyclic circuits that are stable and d...
Osama Neiroukh, Stephen A. Edwards, Xiaoyu Song
LREC
2008
108views Education» more  LREC 2008»
13 years 6 months ago
Comparing Dependency and Constituent Syntax for Frame-semantic Analysis
We address the question of which syntactic representation is best suited for role-semantic analysis of English in the FrameNet paradigm. We compare systems based on dependencies a...
Richard Johansson, Pierre Nugues
MLQ
2006
76views more  MLQ 2006»
13 years 5 months ago
Geometric properties of semilinear and semibounded sets
We calculate the universal Euler characteristic and universal dimension function on semilinear and semibounded sets and obtain some criteria for definable equivalence of semilinea...
Jana Maríková
GLVLSI
2007
IEEE
171views VLSI» more  GLVLSI 2007»
13 years 11 months ago
Combinational equivalence checking for threshold logic circuits
Threshold logic is gaining prominence as an alternative to Boolean logic. The main reason for this trend is the availability of devices that implement these circuits efficiently (...
Tejaswi Gowda, Sarma B. K. Vrudhula, Goran Konjevo...
ENTCS
2007
140views more  ENTCS 2007»
13 years 5 months ago
Admissible Representations of Probability Measures
In a recent paper, probabilistic processes are used to generate Borel probability measures on topological spaces X that are equipped with a representation in the sense of Type-2 T...
Matthias Schröder