Results 31 to 40 of about 2,522,495 (283)

Anomalous percolating properties of growing networks

open access: yes, 2001
We describe the anomalous phase transition of the emergence of the giant connected component in scale-free networks growing under mechanism of preferential linking.
Dorogovtsev, S. N.   +2 more
core   +1 more source

Text Detection in Natural Image By Connected Component Labeling

open access: yesAl-Mustansiriyah Journal of Science, 2019
The process of detect the text from the natural image is complex and difficult process because the variance by the devises that take the images and different the texts that found in images in the orientation, size and style.
zamen abood ramadhan, Dhia Alzubaydi
doaj   +1 more source

Efficient Reversible Data Hiding Based on Connected Component Construction and Prediction Error Adjustment

open access: yesMathematics, 2022
To achieve a good trade-off between the data-embedding payload and the data-embedding distortion, mainstream reversible data hiding (RDH) algorithms perform data embedding on a well-built prediction error histogram.
Limengnan Zhou   +3 more
doaj   +1 more source

Connected Component Labeling Using Quadtrees [PDF]

open access: yesJournal of the ACM, 1981
Abstract : An algorithm is presented for labeling the connected components of an image represented by a quadtree. The algorithm proceeds by exploring all possible adjacencies for each node once and only once. Once this is done, any equivalences generated by the adjacency labeling phase are propagated.
openaire   +1 more source

On the existence of a connected component of a graph

open access: yes, 2015
We study the reverse mathematics and computability of countable graph theory, obtaining the following results. The principle that every countable graph has a connected component is equivalent to $\mathsf{ACA}_0$ over $\mathsf{RCA}_0$.
Gura, Kirill   +2 more
core   +1 more source

Efficient Parallel Connected Component Labeling With a Coarse-to-Fine Strategy

open access: yesIEEE Access, 2018
This paper proposes a new parallel approach to solve connected components on a 2-D binary image. The following strategies are employed to accelerate neighborhood exploration after dividing an input image into independent blocks: 1) in the local labeling ...
Jun Chen   +5 more
doaj   +1 more source

Isomorphic and strongly connected components [PDF]

open access: yesArchive for Mathematical Logic, 2014
16 pages, 1 ...
openaire   +3 more sources

Ancient Chinese Character Image Segmentation Based on Interval-Valued Hesitant Fuzzy Set

open access: yesIEEE Access, 2020
To address the low segmentation accuracy caused by the rich glyph styles of ancient Chinese characters and the complex layout of ancient Chinese books, which affects the retrieval and recognition results, an algorithm for the layout image analysis of ...
Xuedong Tian, Tengying Sun, Yanmei Qi
doaj   +1 more source

Maintenance of Strongly Connected Component in Shared-memory Graph

open access: yes, 2018
In this paper, we present an on-line fully dynamic algorithm for maintaining strongly connected component of a directed graph in a shared memory architecture. The edges and vertices are added or deleted concurrently by fixed number of threads.
C Demetrescu   +4 more
core   +1 more source

A remark on the connectedness of spheres in Cayley graphs [PDF]

open access: yes, 2014
The aim of this small note is to prove an elementary yet useful properties of finitely presented groups. Let G be a finitely generated group with one end. Fix a (finite) generating set and let $B_n$ be the ball of radius $n$ around $e$.
Gournay, Antoine
core   +5 more sources

Home - About - Disclaimer - Privacy