7200 search results - page 216 / 1440 » On the Computational Power of Winner-Take-All |
202
click to vote
CF
2011
ACM
14 years 6 months ago
2011
ACM
Ubiquitous computing has become a very popular paradigm. The most suitable technological solution for those systems consists of using hybrid processors able to operate at high vol...
181
click to vote
HPCA
2005
IEEE
16 years 7 months ago
2005
IEEE
ZettaRAMTM is a new memory technology under development by ZettaCoreTM as a potential replacement for conventional DRAM. The key innovation is replacing the conventional capacitor...
191
click to vote
ISAAC
2007
Springer
16 years 21 days ago
2007
Springer
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
158
click to vote
ICALP
2004
Springer
15 years 12 months ago
2004
Springer
Monadic least fixed point logic MLFP is a natural logic whose expressiveness lies between that of first-order logic FO and monadic second-order logic MSO. In this paper we take ...
143
click to vote
CORR
1999
Springer
15 years 6 months ago
1999
Springer
: In the early 1980s, Selman's seminal work on positive Turing reductions showed that positive Turing reduction to NP yields no greater computational power than NP itself. Thu...