Results 31 to 40 of about 1,536,819 (313)
A Comprehensive Evaluation of Graph Kernels for Unattributed Graphs
Entropy, 2018 Graph kernels are of vital importance in the field of graph comparison and classification. However, how to compare and evaluate graph kernels and how to choose an optimal kernel for a practical classification problem remain open problems.
Yi Zhang, Lulu Wang, Liandong Wang
doaj +1 more source
Complexity Synchronization of Organ Networks [PDF]
, 2023 Article describes how the transdisciplinary nature of science as a whole became evident as the necessity for the complex nature of phenomena to explain social and life science, along with the physical sciences, blossomed into complexity theory and most ...
Piotr J. Franaszczuk +9 more
core +1 more source
On a New Formula for Fibonacci’s Family m-step Numbers and Some Applications
Mathematics, 2019 In this work, we obtain a new formula for Fibonacci’s family m-step sequences. We use our formula to find the nth term with less time complexity than the matrix multiplication method.
Monther Rashed Alfuraidan +1 more
doaj +1 more source
Fast Algorithms for Basic Supply Chain Scheduling Problems
Mathematics, 2020 A basic supply chain scheduling problem in which the orders released over time are to be delivered into the batches with unlimited capacity is considered.
Nodari Vakhania, Badri Mamporia
doaj +1 more source
Spatial modulation and space-time shift keying: optimal performance at a reduced detection complexity [PDF]
, 2013 —In this paper, we propose a comprehensive reduced-complexity detector both for hard-decision-aided as well as for the soft-decision-assisted Spatial Modulation (SM)/Space-Time Shift Keying (STSK).
Sugiura, Shinya +7 more
core +1 more source
Edge decompositions of multigraphs into multi-2-paths [PDF]
Opuscula Mathematica, 2004 We establish the computational time complexity of the existence problem of a decomposition of an instance multigraph into isomorphic 3-vertex paths with multiple edges.
Jan Kratochvil +3 more
doaj
CAAI Transactions on Intelligence Technology, 2019 Differential evolution (DE) is a robust, efficient and simple evolutionary algorithm for various optimisation and engineering problems. It has several outstanding features such as low time complexity, ease to use and robust steadiness.
Xinchao Zhao +3 more
doaj +1 more source
Complexity analysis of spontaneous brain activity: effects of depression and antidepressant treatment [PDF]
, 2011 Magnetoencephalography (MEG) allows the real-time recording of neural activity and oscillatory activity in distributed neural networks. We applied a non-linear complexity analysis to resting-state neural activity as measured using whole-head MEG ...
Tomás Ortiz +21 more
core +1 more source
Shape matching and object recognition using common base triangle area
IET Computer Vision, 2015 Shape matching has always been a key issue in the field of computer vision. To obtain high recognition accuracy with low time complexity and to reduce the influence of contour deformation due to noise in shape matching, a novel shape matching method ...
Dameng Hu +4 more
doaj +1 more source
Time complexity of iterative-deepening-A∗
Artificial Intelligence, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Richard E. Korf +2 more
openaire +2 more sources