7200 search results - page 20 / 1440 » On the Computational Power of Winner-Take-All |
PDPTA
2000
13 years 10 months ago
2000
The growing computational power requirements of grand challenge applications has promoted the need for linking highperformance computational resources distributed across multiple ...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
We consider the model of population protocols introduced by Angluin et al. [AAD+ 04], in which anonymous finite-state agents stably compute a predicate of the multiset of their in...
ASPDAC
2007
ACM
14 years 20 days ago
2007
ACM
In recent years, several alternative devices have been proposed to deal with inherent limitation of conventional CMOS devices in terms of scalability at nanometer scale geometry. ...
SOFSEM
2000
Springer
14 years 6 days ago
2000
Springer
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
IEICET
2008
13 years 8 months ago
2008
In this paper, we introduce a powered Tate pairing on a supersingular elliptic curve that has the same shortened loop as the modified Tate pairing using the eta pairing approach by...