Results 151 to 160 of about 246,310 (302)
Symmetry of positive solutions for Lane-Emden systems involving the Logarithmic Laplacian [PDF]
, 2022 Rong Zhang +2 more
openalex +1 more source
Characterization of the Carbonyl Metalates [Mn2(CO)8]2− and [W2(CO)8]4− Featuring M=M Double Bonds
Zeitschrift für anorganische und allgemeine Chemie, EarlyView.The novel homoleptic carbonyl metalate anions [Mn2(CO)8]2− and [W2(CO)8]4− featuring M=M double bonds are structurally characterized and investigated using quantum chemical calculations and QTAIM methods. The crystal structures of [Rb[2.2.2]crypt]2[Mn2(CO)8] ⋅ 4NH3 and [K[18]crown‐6]2K2[W2(CO)8] ⋅ 14NH3 are reported, containing the first homoleptic ...
Michael Witzmann +2 more
wiley +1 more source
CAAI Transactions on Intelligence Technology, EarlyView.Abstract Graph neural networks (GNNs) have revolutionised the processing of information by facilitating the transmission of messages between graph nodes. Graph neural networks operate on graph‐structured data, which makes them suitable for a wide variety of computer vision problems, such as link prediction, node classification, and graph classification.
Amit Sharma +4 more
wiley +1 more source
Properly-Weighted Graph Laplacian for Semi-supervised Learning [PDF]
, 2019 Jeff Calder, Dejan Slepčev
openalex +1 more source
Enhancing generalized spectral clustering with embedding Laplacian graph regularization
CAAI Transactions on Intelligence Technology, EarlyView.Abstract An enhanced generalised spectral clustering framework that addresses the limitations of existing methods by incorporating the Laplacian graph and group effect into a regularisation term is presented. By doing so, the framework significantly enhances discrimination power and proves highly effective in handling noisy data.
Hengmin Zhang +5 more
wiley +1 more source
Boosted unsupervised feature selection for tumor gene expression profiles
CAAI Transactions on Intelligence Technology, EarlyView.Abstract In an unsupervised scenario, it is challenging but essential to eliminate noise and redundant features for tumour gene expression profiles. However, the current unsupervised feature selection methods treat all samples equally, which tend to learn discriminative features from simple samples.
Yifan Shi +5 more
wiley +1 more source
The Laplacian Spread of a Tree
Discrete Mathematics & Theoretical Computer Science, 2008 The Laplacian spread of a graph is defined to be the difference between the largest eigenvalue and the second smallest eigenvalue of the Laplacian matrix of the graph.
Yi-Zheng Fan +3 more
doaj
The Laplacian in RL: Learning Representations with Efficient Approximations [PDF]
, 2018 Yifan Wu, George Tucker, Ofir Nachum
openalex +1 more source
CAAI Transactions on Intelligence Technology, EarlyView.Abstract In intelligent transportation systems, object detection for a surveillance video is one of the important functions. The performance of existing surveillance video object detection algorithms is affected by the conflict between the features of the objects, which leads to a decline in precision.
Yang He +5 more
wiley +1 more source
Distributed Formation Control for Heterogeneous Robot Systems Based on Competitive Mechanism
CAAI Transactions on Intelligence Technology, EarlyView.ABSTRACT This paper presents an adaptive formation control method for a heterogeneous robot swarm, utilising a multilevel formation task tree to model various types of formation tasks and a single‐state distributed k‐winner‐take‐all (S‐DKWTA) algorithm to address the MRTA problem.
Zhenghui Cui, Xiaoyi Gu, Ning Tan
wiley +1 more source