561 search results - page 4 / 113 » Shortest-Path Kernels on Graphs |
HIPC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Large graphs involving millions of vertices are common in many practical applications and are challenging to process. Practical-time implementations using high-end comput...
AIRS
2008
Springer
14 years 1 months ago
2008
Springer
Abstract. In this paper, we mainly explore the effectiveness of two kernelbased methods, the convolution tree kernel and the shortest path dependency kernel, for Chinese relation e...
COMPGEOM
2000
ACM
13 years 11 months ago
2000
ACM
The algorithms for computing a shortest path on a polyhedral surface are slow, complicated, and numerically unstable. We have developed and implemented a robust and efficient algo...
MICS
2008
13 years 7 months ago
2008
Multi-level overlay graphs represent a speed-up technique for shortest paths computation which is based on a hierarchical decomposition of a weighted directed graph G. They have b...
WADS
2007
Springer
14 years 1 months ago
2007
Springer
Distance oracles and graph spanners are excerpts of a graph that allow to compute approximate shortest paths. Here, we consider the situation where it is possible to access the ori...