• No results found

Graph matching

Robust Textual Inference via Graph Matching

Robust Textual Inference via Graph Matching

... a graph- based representation of sentences, and use graph matching approach to measure the semantic over- lap of ...text. Graph matching techniques have proven to be a useful approach ...

8

Seeded Graph Matching for Correlated Erdos-Renyi Graphs

Seeded Graph Matching for Correlated Erdos-Renyi Graphs

... for graph matching to yield a strongly consistent estimate of the latent alignment; this expands and strengthens the im- portant results in Pedarsani and Grossglauser ...the graph more effectively ...

28

Some Observations in Design Pattern Detection by Graph Matching

Some Observations in Design Pattern Detection by Graph Matching

... XACT GRAPH MATCHING ALGORITHMS Exact graph matching processes [7], used to discover a one-to- one correspondence (isomorphism) between the vertices of two graphs which abstain the similar ...

11

Cross lingual Knowledge Graph Alignment via Graph Matching Neural Network

Cross lingual Knowledge Graph Alignment via Graph Matching Neural Network

... the graph matching layer, we analyze the entities that our model cor- rectly predicts while NodeMatching does ...the graph matching layer enhances the ability of our model in handling the ...

6

Multi scale elastic graph matching for face detection

Multi scale elastic graph matching for face detection

... elastic graph matching (MS-EGM) algorithm for face detection, in which the conventional EGM is improved with two simple image processing techniques of the Gabor wavelet-based pyramid and the weak Gabor ...

12

Graph matching using conformal module

Graph matching using conformal module

... graphing matching [7], however, there still ex- ists several challenges in current ...all matching algorithms require high time complex- ity, so it is difficult to deal with large ...solve graph ...

10

Identification of video subsequence using bipartite graph matching

Identification of video subsequence using bipartite graph matching

... of matching (determined jointly by the granularity, temporal order, and interference ...bipartite graph matching anal- ysis, and they present good experimental ...

18

QUALITY-AWARE SUB GRAPH MATCHING OVER INCONSISTENT PROBABILISTIC GRAPH DATABASE

QUALITY-AWARE SUB GRAPH MATCHING OVER INCONSISTENT PROBABILISTIC GRAPH DATABASE

... In this paper, we study a critical QA-gMatch problem, which retrieves those constantly matching subgraphs from inconsistent probabilistic data graphs with the assure of excessive nice scores. To address the ...

7

Quality-Aware Sub graph Matching Over Inconsistent Probabilistic Graph Database

Quality-Aware Sub graph Matching Over Inconsistent Probabilistic Graph Database

... proportionate diagram portrayal. A case of RDF triples extricated from unstructured , by utilizing two distinct information extraction strategies. Because of the instability of information sources (e.g., the information ...

8

Graph matching with a dual-step EM algorithm

Graph matching with a dual-step EM algorithm

... In Figs. 3a and 3b, we respectively show the final frac- tion of points in correct correspondence as a function of the initial difference in orientation and scale. The dotted lines show the sensitivity of the standard ...

18

Graph Based Filtering and Matching for Symbol Recognition

Graph Based Filtering and Matching for Symbol Recognition

... [24], graph based structural methods always play their prime ...of graph based pattern matching strategy is always subjective to type of ...of graph for specific applications with appropriate ...

25

Canonical Graph Decomposition in Matching

Canonical Graph Decomposition in Matching

... of matching two graphs, for which an optimal solution can only be generated in NP ...original graph, each of these vertices is attributed, and either representation carries the same complexity as the ...

68

Graph Structures Matching for Review Relevance Identification

Graph Structures Matching for Review Relevance Identification

... a graph search and matching approach for multi-document summa- ...The graph matching approach used by Mani and Bloedorn focuses on concept or topics-based matching (noun ...The ...

8

Subgraph Matching Using Graph Neural Network

Subgraph Matching Using Graph Neural Network

... solving graph matching problems and have compared with greedy algorithm approach on graph matching ...sub- graph isomorphism problem in planar graphs in linear time, for any pattern of ...

5

A Graph-Based Approach to Context Matching

A Graph-Based Approach to Context Matching

... While graph matching has been previously used, for instance for image processing [2], we attempt to use it for the matching of context graphs, also improving the graphs by means of special notation ...

7

Subgraph Matching with Set Similarity in a Large Graph Database

Subgraph Matching with Set Similarity in a Large Graph Database

... subgraph matching with set similarity (SMS2) query over a large graph database, which retrieves subgraphs that are structurally isomorphic to the query graph, and during this time period it also ...

6

Radiographic Model Matching with Markov Graph Shape Model

Radiographic Model Matching with Markov Graph Shape Model

... and matching local models which are often requred for skeletal ...Based Graph models can be used instead of Parts and Geometry models to acheive the same purpose and indeed better ...

10

Image matching using relational graph representation

Image matching using relational graph representation

... Over the years, a broad range of image matching techniques has been proposed for various types of data and many domains of application, resulting in a large body of research. Some interesting areas are recovering ...

32

Conditional Strong Matching Preclusion of the Alternating Group Graph

Conditional Strong Matching Preclusion of the Alternating Group Graph

... strong matching preclusion number of a graph is the minimum number of ver- tices and edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect ...strong ...

18

The Quasi Order of Matching Energy of Circum Graph with Chord

The Quasi Order of Matching Energy of Circum Graph with Chord

... λ λ  λ be the roots of matching polynomial of graph G . In order to compare the energies of a pair of graphs, Gutman and Wager further put for- ward the concept of quasi-order relation. In this paper, we ...

7

Show all 4831 documents...

Related subjects