Computing Roadmaps and Connected Components of Algebraic Sets

2003 ◽  
pp. 523-547
Author(s):  
Saugata Basu ◽  
Richard Pollack ◽  
Marie-Francoise Roy
Keyword(s):  
Connected Components ◽  
Algebraic Sets

Homotopies for Connected Components of Algebraic Sets with Application to Computing Critical Sets

2017 ◽  
pp. 107-120 ◽  
Author(s):  
Daniel J. Bates ◽  
Dani A. Brake ◽  
Jonathan D. Hauenstein ◽  
Andrew J. Sommese ◽  
Charles W. Wampler
Keyword(s):  
Connected Components ◽  
Algebraic Sets ◽  
Critical Sets

The algorithm of the color signal recognition at landing an unmanned aerial vehicle on an aircraft carrier in autonomous mode

2020 ◽  
pp. 78
Keyword(s):  
Unmanned Aerial Vehicle ◽  
Treatment Method ◽  
Recognition Algorithm ◽  
Connected Components ◽  
Preliminary Treatment ◽  
Signal Recognition ◽  
Aircraft Carrier ◽  
Halftone Image ◽  
Glide Path ◽  
Aerial Vehicle

The movement along the glide path of an unmanned aerial vehicle during landing on an aircraft carrier is investigated. The implementation of this task is realized in the conditions of radio silence of the aircraft carrier. The algorithm for treatment information from an optical landing system installed on an aircraft carrier is developed. The algorithm of the color signal recognition assumes the usage of the image frame preliminary treatment method via a downsample function, that performs the decimation process, the HSV model, the Otsu’s method for calculating the binarization threshold for a halftone image, and the method of separating the connected Two-Pass components. Keywords unmanned aerial vehicle; aircraft carrier; approach; glide path; optical landing system; color signal recognition algorithm; decimation; connected components; halftone image binarization

scholarly journals Upperbounds on the probability of finding marked connected components using quantum walks

2021 ◽  
Vol 20 (1) ◽  
Author(s):  
Adam Glos ◽  
Nikolajs Nahimovs ◽  
Konstantin Balakirev ◽  
Kamil Khadiev
Keyword(s):  
Quantum Walks ◽  
Connected Components

AN EFFICIENT DISTRIBUTED ALGORITHM FOR 3-EDGE-CONNECTIVITY

2006 ◽  
Vol 17 (03) ◽  
pp. 677-701 ◽  
Author(s):  
YUNG H. TSIN
Keyword(s):  
Distributed Algorithm ◽  
Computer Network ◽  
Connected Components ◽  
Message Complexity ◽  
Edge Connectivity ◽  
Worst Case ◽  
Dense Networks

A distributed algorithm for finding the cut-edges and the 3-edge-connected components of an asynchronous computer network is presented. For a network with n nodes and m links, the algorithm has worst-case [Formula: see text] time and O(m + nhT) message complexity, where hT < n. The algorithm is message optimal when [Formula: see text] which includes dense networks (i.e. m ∈ Θ(n2)). The previously best known distributed algorithm has a worst-case O(n3) time and message complexity.

Affine algebraic sets relative to an algebraic theory

1999 ◽  
Vol 65 (1-2) ◽  
pp. 54-76 ◽  
Author(s):  
Yves Diers
Keyword(s):  
Algebraic Theory ◽  
Algebraic Sets
Sign in / Sign up

Export Citation Format

Share Document