Sciweavers

10054 search results - page 198 / 2011
» On the Complexity of Function Learning
Sort
View
INFORMATICASI
1998
122views more  INFORMATICASI 1998»
15 years 13 days ago
Experimental Evaluation of Three Partition Selection Criteria for Decision Table Decomposition
Decision table decomposition is a machine learning approach that decomposes a given decision table into an equivalent hierarchy of decision tables. The approach aims to discover d...
Blaz Zupan, Marko Bohanec
97
Voted
COMCOM
2010
118views more  COMCOM 2010»
14 years 10 months ago
Mini-slot scheduling for IEEE 802.16d chain and grid mesh networks
This work considers the mini-slot scheduling problem in IEEE 802.16d wireless mesh networks (WMNs). An efficient mini-slot scheduling needs to take into account the transmission o...
Jia-Ming Liang, Ho-Cheng Wu, Jen-Jee Chen, Yu-Chee...
ICASSP
2011
IEEE
14 years 4 months ago
An efficient rank-deficient computation of the Principle of Relevant Information
One of the main difficulties in computing information theoretic learning (ITL) estimators is the computational complexity that grows quadratically with data. Considerable amount ...
Luis Gonzalo Sánchez Giraldo, José C...
104
Voted
AAAI
2006
15 years 2 months ago
Learning Representation and Control in Continuous Markov Decision Processes
This paper presents a novel framework for simultaneously learning representation and control in continuous Markov decision processes. Our approach builds on the framework of proto...
Sridhar Mahadevan, Mauro Maggioni, Kimberly Fergus...
181
Voted

Book
534views
16 years 11 months ago
Neural Networks - A Systematic Introduction
This book covers the following topics: The biological paradigm, Threshold logic, Weighted Networks, The Perceptron, Perceptron learning, Unsupervised learning and clustering algori...
Raul Rojas