1393 search results - page 12 / 279 » Machine Learning by Function Decomposition |
COLT
2004
Springer
15 years 2 months ago
2004
Springer
104
Voted
NPL
2006
14 years 9 months ago
2006
In multi-instance learning, the training examples are bags composed of instances without labels, and the task is to predict the labels of unseen bags through analyzing the training...
105
click to vote
ITCC
2002
IEEE
15 years 2 months ago
2002
IEEE
: Since modern programmable devices contain embedded memory blocks, there exists a possibility to implement Finite State Machines (FSM) using such blocks. The size of the memory av...
62
Voted
ISMVL
1999
IEEE
15 years 1 months ago
1999
IEEE
In this paper, the theory of information relationships and relationship measures is considered and its application to logic design is discussed. This theory makes operational the ...
76
Voted
ALT
2001
Springer
15 years 6 months ago
2001
Springer
Abstract. Learning of recursive functions refutably means that for every recursive function, the learning machine has either to learn this function or to refute it, i.e., to signal...