2294 search results - page 428 / 459 » From Path Graphs to Directed Path Graphs |
CIDM
2007
IEEE
14 years 1 months ago
2007
IEEE
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
ECAI
2006
Springer
14 years 21 days ago
2006
Springer
Abstract. We study resolving conflicts between an action description and a set of conditions (possibly obtained from observations), in the context of action languages. In this form...
ESWS
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. The generation of entity identifiers is a key issue in the context of semantic web technologies. Entity identifiers are needed when we perform any kind of operation (e.g....
AAAI
2010
13 years 10 months ago
2010
Depth-first proof-number search (df-pn) is powerful AND/OR tree search to solve positions in games. However, df-pn has a notorious problem of infinite loops when applied to domain...
NIPS
2008
13 years 10 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...