3396 search results - page 17 / 680 » Tree representations of graphs |
NIPS
2001
13 years 10 months ago
2001
We describe the application of kernel methods to Natural Language Processing (NLP) problems. In many NLP tasks the objects being modeled are strings, trees, graphs or other discre...
DEXAW
2007
IEEE
14 years 3 months ago
2007
IEEE
Several classical schemes exist to represent trees as strings over a fixed alphabet; these are useful in many algorithmic and conceptual studies. Our previous work has proposed a...
ICCS
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Many knowledge representation mechanisms consist of linkbased structures; they may be studied formally by means of unordered trees. Here we consider the case where labels...
ILP
2003
Springer
14 years 1 months ago
2003
Springer
RRL is a relational reinforcement learning system based on Q-learning in relational state-action spaces. It aims to enable agents to learn how to act in an environment that has no ...
DAM
2011
13 years 3 months ago
2011
In this paper, we study the Minimum Sum Set Coloring (MSSC) problem which consists in assigning a set of x(v) positive integers to each vertex v of a graph so that the intersectio...