2695 search results - page 167 / 539 » Learning Graph Matching |
185
click to vote
WWW
2006
ACM
16 years 7 months ago
2006
ACM
On the investigation of linguistic techniques used in ontology matching, we propose a new idea of virtual documents to pursue a cost-effective approach to linguistic matching in t...
209
click to vote
SODA
1997
ACM
15 years 8 months ago
1997
ACM
Given two planar polylines T and P with n and m edges, respectively, we present an O m2 n2 time, O mn space algorithm to nd portions of the text" T which are similar in sh...
243
click to vote
COMBINATORICA
2010
15 years 1 months ago
2010
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
195
click to vote
ICSM
2007
IEEE
16 years 1 months ago
2007
IEEE
In many application areas, including piracy detection, software debugging and maintenance, situations arise in which there is a need for comparing two versions of a program that d...
242
click to vote
ICALP
2005
Springer
16 years 12 days ago
2005
Springer
Given a graph G = (V, E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . ,...