Sciweavers

7 search results - page 2 / 2
» mach 1993
Sort
View
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
15 years 3 months ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass
SOSP
1993
ACM
15 years 1 months ago
Improving IPC by Kernel Design
Inter-process communication (ipc) has to be fast and e ective, otherwise programmers will not use remote procedure calls(RPC),multithreadingand multitasking adequately. Thus ipc p...
Jochen Liedtke