Results 31 to 40 of about 81,428 (311)

Beyond top‐N accuracy indicator: a comprehensive evaluation indicator of CNN models in image classification

open access: yesIET Computer Vision, 2020
Nowadays, a large number of deep convolutional neural network (CNN) models are applied to image classification tasks. However, the authors find that the most widely used evaluation indicator, the Top‐N Accuracy indicator, cannot discriminate these models
Yuntao Liu, Yong Dou, Peng Qiao
doaj   +1 more source

Optimasi Jaringan dengan Spanning Tree untuk Congestion Management

open access: yesComTech, 2014
A proper network optimization is needed to deal with problems on the network and to minimize latency in the data flow in a dense network. The data stream is directed into the right channels so that the optimal network speed and latency can be minimized.
Mayliana Mayliana
doaj   +1 more source

Spanning trees with a bounded number of leaves [PDF]

open access: yesOpuscula Mathematica, 2017
In 1998, H. Broersma and H. Tuinstra proved that: Given a connected graph \(G\) with \(n\geq 3\) vertices, if \(d(u)+d(v)\geq n-k+1\) for all non-adjacent vertices \(u\) and \(v\) of \(G\) (\(k\geq 1\)), then \(G\) has a spanning tree with at most \(k ...
Junqing Cai   +3 more
doaj   +1 more source

Conditions for Implicit-Degree Sum for Spanning Trees with Few Leaves in K1,4-Free Graphs

open access: yesMathematics, 2023
A graph with n vertices is called an n-graph. A spanning tree with at most k leaves is referred to as a spanning k-ended tree. Spanning k-ended trees are important in various fields such as network design, graph theory, and communication networks.
Junqing Cai   +3 more
doaj   +1 more source

Linking and Cutting Spanning Trees [PDF]

open access: yesAlgorithms, 2018
We consider the problem of uniformly generating a spanning tree for an undirected connected graph. This process is useful for computing statistics, namely for phylogenetic trees. We describe a Markov chain for producing these trees. For cycle graphs, we prove that this approach significantly outperforms existing algorithms.
Russo, Luís M. S.    +2 more
openaire   +4 more sources

Mapping the evolution of mitochondrial complex I through structural variation

open access: yesFEBS Letters, EarlyView.
Respiratory complex I (CI) is crucial for bioenergetic metabolism in many prokaryotes and eukaryotes. It is composed of a conserved set of core subunits and additional accessory subunits that vary depending on the organism. Here, we categorize CI subunits from available structures to map the evolution of CI across eukaryotes. Respiratory complex I (CI)
Dong‐Woo Shin   +2 more
wiley   +1 more source

Consensus of Second-Order Multi-Agent Systems Without a Spanning Tree: A Sequence-Based Topology-Dependent Method

open access: yesIEEE Access, 2020
This paper investigates the consensus of second-order multi-agent systems under switched topologies. Previous studies indicate that a consensus cannot be reached if the topology is fixed and has no spanning tree, but it is possible to reach a consensus ...
Dianhao Zheng   +4 more
doaj   +1 more source

Disordered but rhythmic—the role of intrinsic protein disorder in eukaryotic circadian timing

open access: yesFEBS Letters, EarlyView.
Unstructured domains known as intrinsically disordered regions (IDRs) are present in nearly every part of the eukaryotic core circadian oscillator. IDRs enable many diverse inter‐ and intramolecular interactions that support clock function. IDR conformations are highly tunable by post‐translational modifications and environmental conditions, which ...
Emery T. Usher, Jacqueline F. Pelham
wiley   +1 more source

Spanning Trees—Short or Small [PDF]

open access: yesSIAM Journal on Discrete Mathematics, 1996
We study the problem of finding small trees. Classical network design problems are considered with the additional constraint that only a specified number $k$ of nodes are required to be connected in the solution. A prototypical example is the $k$MST problem in which we require a tree of minimum weight spanning at least $k$ nodes in an edge-weighted ...
Ravi, R.   +4 more
openaire   +2 more sources

Characterizing the salivary RNA landscape to identify potential diagnostic, prognostic, and follow‐up biomarkers for breast cancer

open access: yesMolecular Oncology, EarlyView.
This study explores salivary RNA for breast cancer (BC) diagnosis, prognosis, and follow‐up. High‐throughput RNA sequencing identified distinct salivary RNA signatures, including novel transcripts, that differentiate BC from healthy controls, characterize histological and molecular subtypes, and indicate lymph node involvement.
Nicholas Rajan   +9 more
wiley   +1 more source

Home - About - Disclaimer - Privacy