561 search results - page 46 / 113 » Shortest-Path Kernels on Graphs |
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
We propose a novel global pose estimation method to detect body parts of articulated objects in images based on non-tree graph models. There are two kinds of edges defined in the ...
BROADNETS
2006
IEEE
15 years 3 months ago
2006
IEEE
: With the increase of the number of wavelengths per fiber waveband switching has been proposed to decrease the number of switching ports in optical nodes. Another concept that of ...
SWAT
1998
Springer
15 years 1 months ago
1998
Springer
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Reachability and distance computation are known to be NL-complete in general graphs, but within UL co-UL if the graphs are planar. However, finding longest paths is known to be N...
101
click to vote
NIPS
2004
14 years 11 months ago
2004
We present an algorithm based on convex optimization for constructing kernels for semi-supervised learning. The kernel matrices are derived from the spectral decomposition of grap...