561 search results - page 89 / 113 » Shortest-Path Kernels on Graphs |
PAMI
2006
13 years 7 months ago
2006
High dimensional structured data such as text and images is often poorly understood and misrepresented in statistical modeling. The standard histogram representation suffers from ...
DAC
2006
ACM
14 years 8 months ago
2006
ACM
Multimedia applications usually have throughput constraints. An implementation must meet these constraints, while it minimizes resource usage and energy consumption. The compute i...
ICPR
2008
IEEE
14 years 1 months ago
2008
IEEE
In this paper, we propose a novel semi-supervised algorithm, which works under a two-view setting. Our algorithm, named Kernel Canonical Component Analysis Graph (KC-GRAPH), can e...
PPOPP
2009
ACM
14 years 8 months ago
2009
ACM
A stream processor executes an application that has been decomposed into a sequence of kernels that operate on streams of data elements. During the execution of a kernel, all stre...
TAMC
2010
Springer
14 years 13 days ago
2010
Springer
Incrementally k-list coloring a graph means that a graph is given by adding stepwise one vertex after another, and for each intermediate step we ask for a vertex coloring such that...