In this paper, we proposed an efficient graph clustering algorithm, KCoreMotif, specifically for large networks by exploiting k-core decomposition and motifs. We first conducted the k-core decomposition of the
Sparsity order estimation (SOE) is critical so that the sampling rate can be adjusted adaptively for purpose of exploiting fully the potential of CS-based techniques. This paper presents an effective SOE method. Via random matrix theory, the theoretical expression of the sparsity order of ...
In this paper a new branch and bound algorithm based on the rectangular partition and the Lagrangian relaxation for solving sum of quadratic ratios problem with nonconvex quadratic constraints (QSRP) is proposed. Firstly, the problem QSRP is converted into an equivalent sum of linear ratios proble...
This weight factor varies the wolves' movements, allowing for a more flexible search strategy that can adapt based on the current state of the search. It enables the algorithm to maintain a balance between exploring new areas and exploiting known promising regions, thus preventing premature ...
A PyTorch implementation of "Cluster-GCN: An Efficient Algorithm for Training Deep and Large Graph Convolutional Networks" (KDD 2019). - benedekrozemberczki/ClusterGCN
An efficient DoS attack detection system using the oppositional crow search algorithm (OCSA) was proposed in [37], which combines the crow search algorithm (CSA) and the opposition-based learning (OBL) technique. Both the OCSA and RNN classifier are used to identify and classify the proposed ...
8216 AN EFFICIENT ALGORITHM FOR CLUSTERED MULTI-TASK COMPRESSIVE SENSING 5849 AN EFFICIENT ALGORITHM FOR MULTIUSER SUM-RATE MAXIMIZATION OF LARGE-SCALE Active RIS-AIDED MIMO SYSTEM 8339 AN EFFICIENT ALTERNATING RIEMANNIAN/PROJECTED GRADIENT DESCENT ASCENT ALGORITHM FOR FAIR PRINCIPAL COMPONENT ANALYSIS 3158 ...
We propose an improved root-MUSIC algorithm for joint TOA and DOA estimation in the IR-UWB positioning system. By constructing and exploiting the relationship between the received signal of the two antennas, the 2D SPS is transformed into 1D SPS and the polynomial root finding is performed to ...
In this context, the maxT algorithm is one technique to control the false-positive rate. However, the memory needed by this algorithm rises linearly with the amount of hypothesis tests. Gene-gene interaction studies will require a memory proportional to the squared number of SNPs. A genome-...
Efficient data structure traversal on vector architectures. Enable the use of industry-standard .vdb files created through the OpenVDB library. Compatibility with OpenVDB on a leaf data level, so that .vdb file may be loaded with minimal overhead. VDB volumes have the following parameters: TypeNa...