Results 31 to 40 of about 41,748 (161)
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 +3 more sources
Minimum Restricted Diameter Spanning Trees
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Refael Hassin, Asaf Levin
openaire +2 more sources
On Sorting, Heaps, and Minimum Spanning Trees [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gonzalo Navarro 0001, Rodrigo Paredes
openaire +4 more sources
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
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
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
A MINIMUM SPANNING TREE BASED METHOD FOR UAV IMAGE SEGMENTATION [PDF]
This paper proposes a Minimum Span Tree (MST) based image segmentation method for UAV images in coastal area. An edge weight based optimal criterion (merging predicate) is defined, which based on statistical learning theory (SLT).
P. Wang, Z. Wei, W. Cui, Z. Lin
doaj +1 more source
We present an overview of the approximation theory in combinatorial optimization. As an application we consider the Generalized Minimum Spanning Tree (GMST) problem which is defined on an undirected complete graph with the nodes partitioned into ...
Petrică C. Pop, G. Still, W. Kern
doaj +2 more sources
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 +3 more sources

