1736 search results - page 130 / 348 » The rank-width of Directed Graphs |
156
click to vote
GBRPR
2007
Springer
15 years 8 months ago
2007
Springer
We propose in this article an image classification technique based on kernel methods and graphs. Our work explores the possibility of applying marginalized kernels to image process...
138
click to vote
AAAI
2006
15 years 5 months ago
2006
We present a new method for mapping ontology schemas that address similar domains. The problem of ontology mapping is crucial since we are witnessing a decentralized development a...
159
Voted
DBSEC
2008
15 years 5 months ago
2008
To protect critical resources in today’s networked environments, it is desirable to quantify the likelihood of potential multi-step attacks that combine multiple vulnerabilities....
124
click to vote
DAM
2008
15 years 4 months ago
2008
Given an edge- or vertex-weighted graph or digraph and a list of source-sink pairs, the minimum multicut problem consists in selecting a minimum weight set of edges or vertices wh...
149
click to vote
WWW
2006
ACM
16 years 5 months ago
2006
ACM
In this paper, we propose an approach to automatically mine event evolution graphs from newswires on the Web. Event evolution graph is a directed graph in which the vertices and e...