Sciweavers

155 search results - page 3 / 31
» Symplectic Alternating Algebras
Sort
View
APAL
2007
119views more  APAL 2007»
13 years 7 months ago
An algebraic approach to subframe logics. Intuitionistic case
We develop duality between nuclei on Heyting algebras and certain binary relations on Heyting spaces. We show that these binary relations are in 1–1 correspondence with subframe...
Guram Bezhanishvili, Silvio Ghilardi
STACS
2001
Springer
13 years 12 months ago
Myhill-Nerode Relations on Automatic Systems and the Completeness of Kleene Algebra
It is well known that finite square matrices over a Kleene algebra again form a Kleene algebra. This is also true for infinite matrices under suitable restrictions. One can use t...
Dexter Kozen
ICASSP
2008
IEEE
14 years 1 months ago
Alternatives to the discrete fourier transform
It is well-known that the discrete Fourier transform (DFT) of a finite length discrete-time signal samples the discrete-time Fourier transform of the same signal at equidistant p...
Doru-Cristian Balcan, Aliaksei Sandryhaila, Jonath...
MST
1998
76views more  MST 1998»
13 years 7 months ago
Sharply Bounded Alternation and Quasilinear Time
We de ne the sharply bounded hierarchy, SBH(QL), a hierarchy of classes within P, using quasilinear-time computation and quanti cation over strings of length logn. It generalizes ...
Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith
DSD
2010
IEEE
137views Hardware» more  DSD 2010»
13 years 5 months ago
A C-to-RTL Flow as an Energy Efficient Alternative to Embedded Processors in Digital Systems
We present a high-level synthesis flow for mapping an algorithm description (in C) to a provably equivalent registertransfer level (RTL) description of hardware. This flow uses an ...
Sameer D. Sahasrabuddhe, Sreenivas Subramanian, Ku...