Sciweavers

2210 search results - page 112 / 442
» Information complexity of neural networks
Sort
View
ICANN
2010
Springer
15 years 7 months ago
Kernel-Based Learning from Infinite Dimensional 2-Way Tensors
Abstract. In this paper we elaborate on a kernel extension to tensorbased data analysis. The proposed ideas find applications in supervised learning problems where input data have ...
Marco Signoretto, Lieven De Lathauwer, Johan A. K....
NC
2007
116views Neural Networks» more  NC 2007»
15 years 5 months ago
Compositional and holistic quantum computational semantics
In quantum computational logic meanings of sentences are identified with quantum information quantities: systems of qubits or, more generally, mixtures of systems of qubits. We co...
Maria Luisa Dalla Chiara, Roberto Giuntini, Robert...
INFOCOM
2007
IEEE
16 years 21 days ago
Low-Complexity Distributed Scheduling Algorithms for Wireless Networks
— We consider the problem of distributed scheduling in wireless networks. We present two different algorithms whose performance is arbitrarily close to that of maximal schedules,...
Abhinav Gupta, Xiaojun Lin, R. Srikant
SBRN
2000
IEEE
15 years 10 months ago
Adaptation of Parameters of BP Algorithm Using Learning Automata
d Articles >> Table of Contents >> Abstract VI Brazilian Symposium on Neural Networks (SBRN'00) p. 24 Adaptation of Parameters of BP Algorithm Using Automata Hamid...
Hamid Beigy, Mohammad Reza Meybodi
IJCNN
2007
IEEE
16 years 21 days ago
A Wrapper for Projection Pursuit Learning
– Constructive algorithms are effective methods for designing Artificial Neural Networks (ANN) with good accuracy and generalization capability, yet with parsimonious network str...
Leonardo M. Holschuh, Clodoaldo Ap. M. Lima, Ferna...