21324 search results - page 127 / 4265 » Making the case for computing |
135
Voted
PEPM
2009
ACM
15 years 11 months ago
2009
ACM
Many applications need to respond to incremental modifications to data. Being incremental, such modification often require incremental modifications to the output, making it po...
119
click to vote
ESANN
2007
15 years 4 months ago
2007
Abstract. We approach the themes “computing with chaos” and “reservoir computing” in a unified setting. Different neural architectures are mentioned which display chaotic...
118
click to vote
PPAM
2005
Springer
15 years 8 months ago
2005
Springer
We present a web computing library (PUBWCL) in Java that allows to execute tightly coupled, massively parallel algorithms in the bulk-synchronous (BSP) style on PCs distributed ove...
164
Voted
EUROCRYPT
2008
Springer
15 years 4 months ago
2008
Springer
Recently, Aumann and Lindell introduced a new realistic security model for secure computation, namely, security against covert adversaries. The main motivation was to obtain secure...
131
click to vote
SIGSOFT
2007
ACM
16 years 3 months ago
2007
ACM
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...