Results 61 to 70 of about 2,474,612 (263)
Robust GICP-Based 3D LiDAR SLAM for Underground Mining Environment
Unmanned mining is one of the most effective methods to solve mine safety and low efficiency. However, it is the key to accurate localization and mapping for underground mining environment.
Zhuli Ren, Liguan Wang, Lin Bi
doaj +1 more source
The traditional 2D laser slam back-end graph optimization (LSBGO) is not efficient in some special situations, such as fast scene switching, limited computing time, and limited hardware facilities.
Liangliang Gao +5 more
doaj +1 more source
Optimal regular graph designs [PDF]
A typical problem in optimal design theory is finding an experimental design that is optimal with respect to some criteria in a class of designs. The most popular criteria include the A- and D-criteria. Regular graph designs occur in many optimality results and, if the number of blocks is large enough, they are A- and D-optimal.
openaire +4 more sources
Graph Homomorphism Revisited for Graph Matching [PDF]
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional notions of graph homomorphism and isomorphism often fall short of capturing
Li, Jianzhong +4 more
core
In the present work, we have identified a transcriptional signature based on the differential expression of six genes (BCL2&MAST4, HSH2D&LAT2, METRN&PITPNM2) that would facilitate the early detection of T‐cell acute lymphoblastic leukemia (T‐ALL) patients prone to a poor treatment response and could be implemented at diagnosis, along with other risk ...
Antonio Lahera +11 more
wiley +1 more source
Unmanned vehicle fusion positioning method based on 3D point cloud map and ESKF
The precision of the unmanned vehicle positioning method based on map matching depends on the precision of the created map. The precision is less affected by the outside world. The method is suitable for unmanned vehicle positioning in complex scenarios.
CUI Wen +4 more
doaj +1 more source
Evolutionary Optimization of Graphs with GraphEA
Many practically relevant computing artifacts are forms of graphs, as, e.g., neural networks, mathematical expressions, finite automata. This great generality of the graph abstraction makes it desirable a way for searching in the space of graphs able to work effectively regardless of the graph form and application.
Medvet, Eric, Bartoli, Alberto
openaire +2 more sources
Graph-based data caching optimization for edge computing
Graph-based data caching optimization for edge ...
Q He (7930655) +7 more
core
Approximation hardness of optimization problems in intersection graphs of d-dimensional boxes [PDF]
The Maximum Independent Set problem in d-box graphs, i.e., in the intersection graphs of axis-parallel rectangles in R d , is a challenge open problem. For any fixed d ≥ 2 the problem is NP-hard and no approximation algorithm with ratio o(log d−1 n) is ...
Chlebikova, Janka +5 more
core
Towards a Maude tool for model checking temporal graph properties [PDF]
We present our prototypical tool for the verification of graph transformation systems. The major novelty of our tool is that it provides a model checker for temporal graph properties based on counterpart semantics for quantified m-calculi.
Lluch-Lafuente, Alberto +4 more
core +1 more source

