Sciweavers

3690 search results - page 109 / 738
» Computation with classical sequents
Sort
View
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
15 years 2 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
CORR
2010
Springer
200views Education» more  CORR 2010»
14 years 10 months ago
Unified Compression-Based Acceleration of Edit-Distance Computation
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...
Danny Hermelin, Gad M. Landau, Shir Landau, Oren W...
ENTCS
2007
153views more  ENTCS 2007»
14 years 10 months ago
The Methods of Approximation and Lifting in Real Computation
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether de...
Manuel Lameiras Campagnolo, Kerry Ojakian
CHI
2010
ACM
15 years 4 months ago
GUI testing using computer vision
Testing a GUI’s visual behavior typically requires human testers to interact with the GUI and to observe whether the expected results of interaction are presented. This paper pr...
Tsung-Hsiang Chang, Tom Yeh, Robert C. Miller
ISCAS
2007
IEEE
123views Hardware» more  ISCAS 2007»
15 years 4 months ago
An Organic Computing architecture for visual microprocessors based on Marching Pixels
—The paper presents architecture and synthesis results for an organic computing hardware for smart CMOS camera chips. The organic behavior in the chip hardware is based on distri...
Dietmar Fey, Marcus Komann, Frank Schurz, Andreas ...