1399 search results - page 152 / 280 » Multi-party Finite Computations |
148
click to vote
MEMOCODE
2003
IEEE
15 years 9 months ago
2003
IEEE
In this paper, we present a technique for determining tight bounds on the execution time of assembler programs. Thus, our method is independent of the design flow, but takes into...
119
click to vote
CCECE
2009
IEEE
15 years 9 months ago
2009
IEEE
This paper presents a 10-Gb/s backplane transmitter with a finite impulse response (FIR) pre-emphasis equalizer to suppress inter-symbol-interference (ISI) at data centers and tra...
125
click to vote
EUROCAST
1997
Springer
15 years 8 months ago
1997
Springer
We show how to use recursive function theory to prove Turing universality of finite analog recurrent neural nets, with a piecewise linear sigmoid function as activation function. W...
147
click to vote
ASPDAC
2006
ACM
15 years 8 months ago
2006
ACM
Newton is a library-based CAD tool with an analytical synthesis engine which has been developed to support the direct synthesis of the physical design and an electromechanically eq...
145
click to vote
EUROGP
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Theoretical models of Turing complete linear genetic programming (GP) programs suggest the fraction of halting programs is vanishingly small. Convergence results proved f...