1658 search results - page 23 / 332 » Learning Unknown Graphs |
AIED
2007
Springer
15 years 8 months ago
2007
Springer
Lesson graphs are composed of Learning Objects (LOs) and include a valuable amount of information about the content and usage of the LOs, described by the LO metadata. Graphs also ...
127
click to vote
ISNN
2005
Springer
15 years 7 months ago
2005
Springer
This paper presents a learning framework for blind source separation (BSS), in which the BSS is formulated as generalized Eigenvalue (GE) problem. Compared to the typical informati...
109
click to vote
CP
2006
Springer
15 years 5 months ago
2006
Springer
The problem of finding a graceful labelling of a graph, or proving that the graph is not graceful, has previously been modelled as a CSP. A new and much faster CSP model of the pro...
TIT
2008
15 years 1 months ago
2008
A novel, non-trivial, probabilistic upper bound on the entropy of an unknown one-dimensional distribution, given the support of the distribution and a sample from that distribution...
ACL
1998
15 years 3 months ago
1998
We introduce an approach to the automatic acquisition of new concepts fi'om natural language texts which is tightly integrated with the underlying text understanding process....