Results 221 to 230 of about 164,290 (263)
Some of the next articles are maybe not open access.
A 3D Lidar SLAM Algorithm Based on Graph Optimization in Indoor Scene
2022 6th Asian Conference on Artificial Intelligence Technology (ACAIT), 2022To improve the localization precision of the 3D lidar SLAM algorithm and solve the problem of z-axis offset, a method to improve the loop closure by adding edge constrains and ground constrains is proposed based on graph optimization in indoor scene ...
Bing Chen +5 more
semanticscholar +1 more source
The connectivity ofZ-transformation graphs of perfect matchings of hexagonal systems
Acta Mathematicae Applicatae Sinica, 1988An hexagonal system is a 2-connected finite plane graph in which each face other than the exterior is bounded by a hexagon. The Z- transformation graph Z(H) of the hexagonal system H has vertices corresponding to the 1-factors of H and two vertices are adjacent if the symmetric difference of their corresponding 1-factors consists of the six edges of a ...
Zhang, Fuji, Guo, Xiaofeng, Chen, Rongsi
openaire +1 more source
Ars Comb., 1999
Summary: Let \(G\) be a connected plane bipartite graph. The \(Z\)-transformation graph \(Z(G)\) is a graph where the vertices are the perfect matchings of \(G\) and where two perfect matchings are joined by an edge provided their symmetric difference is the boundary of an interior face of \(G\). For a plane elementary bipartite graph \(G\) it is shown
Zhang, HP, Zhang, FJ
openaire +1 more source
Summary: Let \(G\) be a connected plane bipartite graph. The \(Z\)-transformation graph \(Z(G)\) is a graph where the vertices are the perfect matchings of \(G\) and where two perfect matchings are joined by an edge provided their symmetric difference is the boundary of an interior face of \(G\). For a plane elementary bipartite graph \(G\) it is shown
Zhang, HP, Zhang, FJ
openaire +1 more source
Linear Depth QFT over IBM Heavy-hex Architecture
arXiv.orgCompiling a given quantum algorithm into a target hardware architecture is a challenging optimization problem. The compiler must take into consideration the coupling graph of physical qubits and the gate operation dependencies.
Xiangyu Gao +4 more
semanticscholar +1 more source
Continuous Forcing Spectra of Even Polygonal Chains
Acta Mathematicae Applicatae Sinica (English Series), 2021Heping Zhang, Xiaoyan Jiang
semanticscholar +2 more sources
The Verigraph System for Graph Transformation
Graph Transformation, Specifications, and Nets, 2018G. G. Azzi +5 more
semanticscholar +1 more source
GraphX: a resilient distributed graph system on Spark
International Workshop on Graph Data Management Experiences and Systems, 2013Reynold Xin +3 more
semanticscholar +1 more source
Tutorial on DNA Computing and Graph Transformation
International Conference on Graph Transformation, 2004T. Harju, Ion Petre, G. Rozenberg
semanticscholar +1 more source
Test Case Generation from Graph Transformation Systems Using Deep Reinforcement Learning
International Conference on Graph TransformationSimin Ghasemi +4 more
semanticscholar +1 more source
Graph Surfing by Reaction Systems
International Conference on Graph Transformation, 2018H. Kreowski, G. Rozenberg
semanticscholar +1 more source