Sciweavers

8 search results - page 2 / 2
» Monotone Circuits for Weighted Threshold Functions
Sort
View
ECCC
2000
158views more  ECCC 2000»
13 years 4 months ago
On the Computational Power of Winner-Take-All
This article initiates a rigorous theoretical analysis of the computational power of circuits that employ modules for computing winner-take-all. Computational models that involve ...
Wolfgang Maass
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
13 years 8 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
KDD
2001
ACM
118views Data Mining» more  KDD 2001»
14 years 5 months ago
Infominer: mining surprising periodic patterns
In this paper, we focus on mining surprising periodic patterns in a sequence of events. In many applications, e.g., computational biology, an infrequent pattern is still considere...
Jiong Yang, Wei Wang 0010, Philip S. Yu