482 search results - page 28 / 97 » A Linear-Time Graph Kernel |
JMLR
2010
14 years 4 months ago
2010
Kernel approximation is commonly used to scale kernel-based algorithms to applications containing as many as several million instances. This paper analyzes the effect of such appr...
BMCBI
2008
14 years 9 months ago
2008
Background: Recent discoveries of a large variety of important roles for non-coding RNAs (ncRNAs) have been reported by numerous researchers. In order to analyze ncRNAs by kernel ...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We study a general class of problems called F -Deletion problems. In an F -Deletion problem, we are asked whether a subset of at most k vertices can be deleted from a graph G such...
ICML
2004
IEEE
15 years 10 months ago
2004
IEEE
CORR
2006
Springer
14 years 9 months ago
2006
Springer
We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs. 1 ...