482 search results - page 64 / 97 » A Linear-Time Graph Kernel |
103
click to vote
SIAMDM
2010
14 years 4 months ago
2010
Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...
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...
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...
ICCAD
2007
IEEE
15 years 6 months ago
2007
IEEE
— We present a new linear time technique to compute criticality information in a timing graph by dividing it into “zones”. Errors in using tightness probabilities for critica...
INEX
2005
Springer
15 years 3 months ago
2005
Springer
Self-Organizing Maps capable of encoding structured information will be used for the clustering of XML documents. Documents formatted in XML are appropriately represented as graph ...