2695 search results - page 87 / 539 » Learning Graph Matching |
229
click to vote
ASUNAM
2011
IEEE
14 years 2 months ago
2011
IEEE
—Users querying massive social networks or RDF databases are often not 100% certain about what they are looking for due to the complexity of the query or heterogeneity of the dat...
111
click to vote
GRAPHICSINTERFACE
2009
15 years 5 days ago
2009
This paper presents a technique for visualizing the differences between two graphs. The technique assumes that a unique labeling of the nodes for each graph is available, where if...
106
click to vote
ICML
2009
IEEE
16 years 3 months ago
2009
IEEE
Previous studies on multi-instance learning typically treated instances in the bags as independently and identically distributed. The instances in a bag, however, are rarely indep...
125
click to vote
BPM
2005
Springer
15 years 8 months ago
2005
Springer
: The capability to easily find useful services becomes increasingly critical in several fields. In this paper we argue that, in many situations, the service discovery process shou...
119
click to vote
CORR
2006
Springer
15 years 2 months ago
2006
Springer
We show that the number of k-matching in a given undirected graph G is equal to the number of perfect matching of the corresponding graph Gk on an even number of vertices divided ...