Results 31 to 40 of about 38,008 (262)
Minimum-Spanning-Tree-Based Time Delay Estimation Robust to Outliers
In this paper, we present a novel approach to estimating multiple time delays (TDs) in sensor arrays that is robust to outliers of TD measurements. These measurements are typically obtained from the peak of the cross correlation of two sensor signals but
Kouei Yamaoka +3 more
doaj +1 more source
Drawing a tree as a minimum spanning tree approximation
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
DI GIACOMO, Emilio +3 more
openaire +2 more sources
On the Length of a Random Minimum Spanning Tree [PDF]
We study the expected value of the lengthLnof the minimum spanning tree of the complete graphKnwhen each edgeeis given an independent uniform [0, 1] edge weight. We sharpen the result of Frieze [6] that limn→∞$\mathbb{E}$(Ln) = ζ(3) and show that$$ \mathbb{E}(L_n)=\zeta(3)+\frac{c_1}{n}+\frac{c_2+o(1)}{n^{4/3}}, $$wherec1,c2are explicitly defined ...
Colin Cooper +4 more
openaire +3 more sources
Minimum Restricted Diameter Spanning Trees
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Refael Hassin, Asaf Levin
openaire +1 more source
A minimum spanning tree analysis of the Polish stock market
Aim/purpose – This article aims to explore the network topology of the stock market in Poland during the COVID-19 pandemic.
Tomeczek Artur F.
doaj +1 more source
Structural insights and therapeutic targets in Acinetobacter baumannii capsule biosynthesis
Hypervirulent KL49 A. baumannii's capsular polysaccharide contains the nonulosonic acid 8‐epi‐Leg5,7Ac2, synthesized by epimerization via ElaA, ElaB, and ElaC. Crystal structures of ElaA, ElaB, and ElaC reveal their role in CMP‐Leg5,7Ac2 synthesis and regioselective C8 epimerization.
Woo Cheol Lee +7 more
wiley +1 more source
The Budgeted Labeled Minimum Spanning Tree Problem
In order to reduce complexity when designing multi-media communication networks, researchers often consider spanning tree problems defined on edge-labeled graphs.
Raffaele Cerulli +3 more
doaj +1 more source
Minimum Spanning Tree for the Implementation of Kruskal’s Algorithm
Kruskal’s algorithm is an algorithm used to find a minimum spanning tree in graph connectivity which gives an option to keep processing the edge limit with the least weight.
Paryati Paryati, Ahmad Subhan Yazid
doaj +1 more source
EXOSC10, an essential nuclear RNA exosome‐associated 3′‐5′ exoribonuclease, is inhibited by the anticancer drug 5‐fluorouracil (5‐FU), and EXOSC10 depletion increases 5‐FU sensitivity. The colon‐cancer variant EXOSC10S402T, located in a proteolysis motif, is stable and nuclear but nonfunctional in vivo.
Radhika Sain +10 more
wiley +1 more source
20 pages, 14 figures. Full version of a paper to be presented at the 41st European Workshop on Computational Geometry, Liblice, Czech republic, April 9-11, 2025. (EuroCG'25)
Katharina Klost +4 more
openaire +2 more sources

