„Graph Matching“

Suchergebnisse

1.007 Treffer

• A subgraph matching algorithm based on subgraph index for knowledge graph
  Sun, Yunhao ; Li, Guanyu ; Du, Jingjing ; Ning, Bo ; Chen, Heng
• Quinary High‐Entropy‐AlloyGraphite Nanocapsules with Tunable Interfacial Impedance Matching for Optimizing Microwave Absorption
  Li, Yixing ; Liao, Yijun ; Ji, Lianze ; Hu, Chenglong ; Zhang, Zhenhua ; Zhang, Zhengyu ; Zhao, Rongzhi ; Rong, Huawei ; Qin, Gaowu ; Zhang, Xuefeng
• Improved reversible data hiding scheme employing dual image-based least significant bit matching for secure image communication using style transfer
  Jaya Prakash, S. ; Mahalakshmi, K.
• The matching problem for strongly chordal graphs is in NC
  Dahlhaus, Elias ; Karpiński, Marek 1986 Inst. für Informatik
• Parallel construction of perfect matchings and Hamiltonian cycles on dense graphs
  Dahlhaus, Elias ; Karpiński, Marek 1987 Inst. für Informatik
• Parallel complexity for matching restricted to degree defined graph classes
  Dahlhaus, Elias ; Karpiński, Marek 1987 Univ. Bonn
• A parallel algorithm for maximum matching in planar graphs
  Dahlhaus, Elias ; Karpiński, Marek ; Lingas, Andrzej 1989 Inst. für Informatik
• Single‐Atom Catalyst Aggregates: Size‐Matching is Critical to Electrocatalytic Performance in Sulfur Cathodes
  Meng, Xiaodong ; Liu, Xing ; Fan, Xueying ; Chen, Xin ; Chen, Shang ; Meng, Yongqiang ; Wang, Manyun ; Zhou, Ji ; Hong, Song ; Zheng, Lei ; Shi, Guosheng ; Bielawski, Christopher W. ; Geng, Jianxin
• The phantom alignment strength conjecture: practical use of graph matching alignment strength to indicate a meaningful graph match
  Fishkind, Donniell E. ; Parker, Felix ; Sawczuk, Hamilton ; Meng, Lingyao ; Bridgeford, Eric ; Athreya, Avanti ; Priebe, Carey ; Lyzinski, Vince
• Graph embedding based real-time social event matching for EBSNs recommendation
  Wu, Gang ; Li, Leilei ; Li, Xueyu ; Chen, Yongzheng ; Chen, Zhiyong ; Qiao, Baiyou ; Han, Donghong ; Xia, Li
• A general parsing algorithm with context matching for context-sensitive graph grammars
  Zou, Yang ; Zeng, Xiaoqin ; Zhu, Yun
• Lower Bounds of Distance Laplacian Spectral Radii of n-Vertex Graphs in Terms of Fractional Matching Number
  Yan, Jin ; Liu, Yan ; Su, Xue-Li
• Area-based correlation and non-local attention network for stereo matching
  Li, Xing ; Fan, Yangyu ; Lv, Guoyun ; Ma, Haoyue
• Matchings in Complete Bipartite Graphs and the r-Lah Numbers
  Nyul, Gábor ; Rácz, Gabriella
• Exploiting Semantic and Boundary Information for Stereo Matching
  Peng, Fang ; Tan, Yu ; Zhang, Cheng
• Audio steganography with less modification to the optimal matching CNV-QIM path with the minimal hamming distance expected value to a secret
  Sun, Xinhao ; Wang, Kaixi ; Li, Shujun
• Efficient parallel edge-centric approach for relaxed graph pattern matching
  Bouhenni, Sarra ; Yahiaoui, Saïd ; Nouali-Taboudjemat, Nadia ; Kheddouci, Hamamache
• Line and point matching based on the maximum number of consecutive matching edge segment pairs for large viewpoint changing images
  Wang, Luzi ; Qian, Yunsheng ; Kong, Xiangyu
• Cross-device recognition of dorsal hand vein images by two-stage coarse-to-fine matching
  Wang, Yiding ; Cao, Xiaotong ; Miao, Xia
• A note on maximum fractional matchings of graphs
  Ma, Tianlong ; Cheng, Eddie ; Mao, Yaping ; Wang, Xu