523 search results - page 33 / 105 » Decidability of string graphs |
121
click to vote
COCOON
2006
Springer
15 years 7 months ago
2006
Springer
: Inferring graphs from path frequency has been studied as an important problem which has a potential application to drug design and elucidation of chemical structures. Given a mul...
137
click to vote
JCB
2008
15 years 3 months ago
2008
Traditionally nonrecombinant genome, i.e., mtDNA or Y chromosome, has been used for phylogeography, notably for ease of analysis. The topology of the phylogeny structure in this c...
110
click to vote
ICML
2003
IEEE
16 years 4 months ago
2003
IEEE
A new kernel function between two labeled graphs is presented. Feature vectors are defined as the counts of label paths produced by random walks on graphs. The kernel computation ...
132
click to vote
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
103
click to vote
ICML
2002
IEEE
16 years 4 months ago
2002
IEEE
The application of kernel-based learning algorithms has, so far, largely been confined to realvalued data and a few special data types, such as strings. In this paper we propose a...