482 search results - page 44 / 97 » A Linear-Time Graph Kernel |
110
click to vote
NIPS
2008
15 years 4 months ago
2008
Many interesting problems, including Bayesian network structure-search, can be cast in terms of finding the optimum value of a function over the space of graphs. However, this fun...
135
click to vote
NIPS
2004
15 years 4 months ago
2004
This paper presents an application of Boosting for classifying labeled graphs, general structures for modeling a number of real-world data, such as chemical compounds, natural lan...
148
click to vote
ANNPR
2008
Springer
15 years 5 months ago
2008
Springer
Clustering constitutes an ubiquitous problem when dealing with huge data sets for data compression, visualization, or preprocessing. Prototype-based neural methods such as neural g...
115
click to vote
EMNLP
2009
15 years 1 months ago
2009
In this paper, we propose a novel class of graphs, the tripartite directed acyclic graphs (tDAGs), to model first-order rule feature spaces for sentence pair classification. We in...
140
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
We consider the problem of constructing bounded-degree planar geometric spanners of Euclidean and unit-disk graphs. It is well known that the Delaunay subgraph is a planar geometri...