126 search results - page 6 / 26 » nips 2001 |
NIPS
2001
15 years 1 months ago
2001
We study the dynamics of a Hebbian ICA algorithm extracting a single non-Gaussian component from a high-dimensional Gaussian background. For both on-line and batch learning we fin...
104
click to vote
NIPS
2001
15 years 1 months ago
2001
Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an association...
107
Voted
NIPS
2001
15 years 1 months ago
2001
We present an algorithm that induces a class of models with thin junction trees--models that are characterized by an upper bound on the size of the maximal cliques of their triang...
NIPS
2001
15 years 1 months ago
2001
This article presents a Support Vector Machine (SVM) like learning system to handle multi-label problems. Such problems are usually decomposed into many two-class problems but the...
NIPS
2001
15 years 1 months ago
2001
When a client interacts with an expert, e.g. a doctor, it falls upon the expert to ask questions that steer the process towards fulfilling the client's needs. This is most ef...