3396 search results - page 231 / 680 » Tree representations of graphs |
165
click to vote
ILP
2005
Springer
16 years 1 days ago
2005
Springer
Abstract. This paper is concerned with generalization issues for a decision tree learner for structured data called Alkemy. Motivated by error bounds established in statistical lea...
153
click to vote
IAT
2009
IEEE
16 years 1 months ago
2009
IEEE
—We present the STORIES methods and tool for (a) an abstracted story representation from a collection of time-indexed documents; (b) visualising it in a way that encourages users...
205
click to vote
CPM
2006
Springer
15 years 10 months ago
2006
Springer
For two strings a, b, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In a previous paper, we defined a generalisat...
191
click to vote
EOR
2002
15 years 6 months ago
2002
Precedence constraints are a part of a definition of any scheduling problem. After recalling, in precise graph-theoretical terms, the relations between task-on-arc and task-on-nod...
170
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
The k-Nearest Neighbors algorithm can be easily adapted to classify complex objects (e.g. sets, graphs) as long as a proper dissimilarity function is given over an input space. Bo...