5608 search results - page 223 / 1122 » On the Theory of Matchgate Computations |
178
click to vote
CORR
2000
Springer
15 years 6 months ago
2000
Springer
This paper takes a computational learning theory approach to a problem of linear systems identification. It is assumed that inputs are generated randomly from a known class consist...
135
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
We study xpoints of operators on lattices. To this end we introduce the notion of an approximation of an operator. We order approximations by means of a precision ordering. We sho...
174
click to vote
ISF
2000
15 years 6 months ago
2000
Knowledge management systems are used widely in many different organizations, yet there are few models and theories which can be used to help introduce and apply them successfully....
175
click to vote
JACM
2002
15 years 6 months ago
2002
An exponential lower bound on the circuit complexity of deciding the weak monadic second-order theory of one successor (WS1S) is proved. Circuits are built from binary operations, ...
134
click to vote
IJON
1998
15 years 6 months ago
1998
The method presented here is aimed to a direct fast setting of the parameters of a RBF network for function approximation. It is based on a hierarchical gridding of the input spac...