281 search results - page 34 / 57 » Graph Kernels |
SSPR
1998
Springer
15 years 2 months ago
1998
Springer
This paper presents a probabilistic similarity measure for object recognition from large libraries of line-patterns. We commence from a structural pattern representation which use...
108
click to vote
PPOPP
2009
ACM
15 years 10 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
15 years 2 months 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...
ESA
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We obtain faster algorithms for problems such as rdimensional matching, r-set packing, graph packing, and graph edge packing when the size k of the solution is considered...
101
click to vote
KDD
2010
ACM
14 years 8 months ago
2010
ACM
Scalable similarity search is the core of many large scale learning or data mining applications. Recently, many research results demonstrate that one promising approach is creatin...