58 search results - page 5 / 12 » On the Generalized Linear Equivalence of Functions Over Fini... |
CHES
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. This paper presents a design-space exploration of an applicationspecific instruction-set processor (ASIP) for the computation of various cryptographic pairings over Barre...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We compare the expressiveness of two extensions of monadic second-order logic (MSO) over the class of finite structures. The first, counting monadic second-order logic (CMSO), ex...
AICT
2009
IEEE
14 years 14 days ago
2009
IEEE
—In this paper, nonlinear digital filters with finite precision are analyzed as recursive systematic convolutional (RSC) encoders. An infinite impulse response (IIR) digital filt...
ACSC
2005
IEEE
14 years 1 months ago
2005
IEEE
Parallel pattern-matching (PPM) provides true commutative implementation of functions defined by cases in functional languages, because no argument is given precedence over any o...
SCW
2012
IEEE
12 years 2 months ago
2012
IEEE
We consider pure exchange economies with finitely many private goods involving the choice of a public project. We discuss core-equivalence results in the general framework of non...