ABSTRACT: Let G=( V,E ) be a graph. The first Zagreb index of a graph G is defined as ∑ u∈V d G 2 ( u ) , where d G ( u ) is the degree of vertex u in G . In this paper, we obtain two lower bounds ...
Abstract: Apart from the continuous time phenomena various discrete events occur in an electric power system. Previously, the size and operation of the power systems were considerably small and ...
The Master of Arts in Mathematics (MA) degree can be completed entirely online. To obtain this degree, a student needs to pass 11 courses with a GPA of 3.0 or better. One of these courses is the ...
Department of Materials Science and Engineering, City University of Hong Kong, Kowloon 999077, Hong Kong China Department of Physics, City University of Hong Kong, Kowloon 999077, Hong Kong China ...
Abstract: Multisource information fusion is a major area of interest within the field of unmanned technology. In comparison with utilizing the Kalman filter (KF)-based method, the factor graph ...
School of Mathematics and Statistics, Qinghai Normal University, Xining 810008, Qinghai, P. R. China State Key Laboratory for Tibetan Intelligent Information Processing and Application, Xining 810008, ...
This is the official source code repo of paper "Masked Graph Autoencoder with Non-discrete Bandwidths" in TheWebConf(WWW) 2024. We explore a new paradigm of topological masked graph autoencoders with ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback