1327 search results - page 44 / 266 » Path following algorithm for the graph matching problem |
112
Voted
SODA
2010
ACM
15 years 11 months ago
2010
ACM
A Random Geometric Graph (RGG) in two dimensions is constructed by distributing n nodes independently and uniformly at random in [0, n ]2 and creating edges between every pair of...
121
click to vote
ICPR
2004
IEEE
16 years 2 months ago
2004
IEEE
Given two or more images, we can define different but related problems on pattern matching such as image registration, pattern detection and localization, and common pattern disco...
111
click to vote
PVLDB
2010
15 years 2 days ago
2010
Graph pattern matching is typically defined in terms of subgraph isomorphism, which makes it an np-complete problem. Moreover, it requires bijective functions, which are often to...
SIAMDM
1998
15 years 1 months ago
1998
Consider the problem of transporting a set of objects between the vertices of a simple graph by a vehicle that traverses the edges of the graph. The problem of finding a shortest...
105
click to vote
WWW
2004
ACM
16 years 2 months ago
2004
ACM
In this paper, we address the problem of matching I/O descriptions of services to enable their automatic service composition. Specifically, we develop a method of semantic schema ...