107 search results - page 11 / 22 » Polynomially Bounded Matrix Interpretations |
DM
2010
13 years 6 months ago
2010
A boolean circuit represents an n by n (0,1)-matrix A if it correctly computes the linear transformation y = Ax over GF(2) on all n unit vectors. If we only allow linear boolean f...
CDC
2009
IEEE
13 years 10 months ago
2009
IEEE
This paper adresses the variance quantification problem for system identification based on the prediction error framework. The role of input and model class selection for the auto-...
ICFCA
2009
Springer
14 years 1 months ago
2009
Springer
Matrix decomposition methods provide representations of an object-variable data matrix by a product of two different matrices, one describing relationship between objects and hidd...
UAI
2003
13 years 8 months ago
2003
Many practitioners who use EM and related algorithms complain that they are sometimes slow. When does this happen, and what can be done about it? In this paper, we study the gener...
STOC
1993
ACM
13 years 10 months ago
1993
ACM
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...