1722 search results - page 265 / 345 » Variables in Concept Graphs |
157
click to vote
NIPS
2008
15 years 5 months ago
2008
For supervised and unsupervised learning, positive definite kernels allow to use large and potentially infinite dimensional feature spaces with a computational cost that only depe...
122
click to vote
CSREASAM
2006
15 years 5 months ago
2006
: Traditional state modeling techniques have several limitations. One of these is the reduced ability to model a large number of variables simultaneously. Another limitation is tha...
126
Voted
UAI
2004
15 years 5 months ago
2004
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...
122
click to vote
NIPS
2003
15 years 5 months ago
2003
Consider a number of moving points, where each point is attached to a joint of the human body and projected onto an image plane. Johannson showed that humans can effortlessly det...
134
click to vote
AAAI
1994
15 years 5 months ago
1994
A constraint satisfaction problem (CSP) is a problem to find an assignment that satisfies given constraints. An interesting approach to CSP is a repair-based method that first gen...