Results 31 to 40 of about 450,197 (278)
A new approach for ranking decision-making units in data envelopment analysis by using communication game theory [PDF]
Iranian Journal of Numerical Analysis and OptimizationRanking decision making units (DMUs) is an important topic in data en-velopment analysis (DEA). When efficient DMUs or inefficient DMUs have the same efficiency score, the traditional DEA model usually fails to rank all DMUs.
M. Amiri, A. Ashrafi
doaj +1 more source
Shapley ratings in brain networks
Frontiers in Neuroinformatics, 2007 Recent applications of network theory to brain networks as well as the expanding empirical databases of brain architecture spawn an interest in novel techniques for analyzing connectivity patterns in the brain.
Rolf Kötter +7 more
doaj +1 more source
Three topological features of regulatory networks control life-essential and specialized subsystems
Scientific Reports, 2021 Gene regulatory networks (GRNs) play key roles in development, phenotype plasticity, and evolution. Although graph theory has been used to explore GRNs, associations amongst topological features, transcription factors (TFs), and systems essentiality are ...
Ivan Rodrigo Wolf +2 more
doaj +1 more source
Determination of the Shortest Hamiltonian Paths in an Arbitrary Graph of Distributed Databases
Российский технологический журнал, 2019 A method has been developed for finding the shortest Hamiltonian path in an arbitrary graph based on the rank approach, which provides high efficiency and a significant reduction in the error in solving the problem of organizing the process of managing ...
E. G. Andrianova +2 more
doaj +1 more source
Journal of Marine Science and Engineering, 2023 We aimed to improve the performance of ship detection methods in synthetic aperture radar (SAR) images by utilizing machine learning (ML) and artificial intelligence (AI) techniques.
Muhammad Yasir +5 more
doaj +1 more source
Orthogonal Representations, Projective Rank, and Fractional Minimum Positive Semidefinite Rank: Connections and New Directions [PDF]
, 2017 Fractional minimum positive semidefinite rank is defined from r-fold faithful orthogonal representations and it is shown that the projective rank of any graph equals the fractional minimum positive semidefinite rank of its complement.
Hogben, L +3 more
core +1 more source
Asymptotic tensor rank of graph tensors: beyond matrix multiplication [PDF]
Computational Complexity, 2016 We present an upper bound on the exponent of the asymptotic behaviour of the tensor rank of a family of tensors defined by the complete graph on k vertices.
M. Christandl +2 more
semanticscholar +1 more source
RAG: RNA-As-Graphs web resource
BMC Bioinformatics, 2004 Background The proliferation of structural and functional studies of RNA has revealed an increasing range of RNA's structural repertoire. Toward the objective of systematic cataloguing of RNA's structural repertoire, we have recently described the basis ...
Laserson Uri +6 more
doaj +1 more source
Journal of Marine Science and Engineering, 2022 In order to detect multi-ship encounter situations and improve the safety of navigation, this paper proposed a model which was able to mine multi-ship encounter situations from Automatic identification system (AIS) data and analyze the encounter spatial ...
Jixiang Zhu +4 more
doaj +1 more source
Chip-firing games on Eulerian digraphs and NP-hardness of computing the rank of a divisor on a graph
, 2015 Baker and Norine introduced a graph-theoretic analogue of the Riemann-Roch theory. A central notion in this theory is the rank of a divisor. In this paper we prove that computing the rank of a divisor on a graph is NP-hard.
Kiss, Viktor, Tóthmérész, Lilla
core +1 more source