Sign Up to like & get recommendations! 1
Published in 2017 at "Mathematische Annalen"
DOI: 10.1007/s00208-018-1668-x
Abstract: Let k be a complete nontrivially valued non-archimedean field. Given a finite morphism of quasi-smooth k-analytic curves that admit finite triangulations, we provide upper bounds for the number of connected components of the ramification locus in… read more here.
Sign Up to like & get recommendations! 0
Published in 2018 at "Journal of Mathematical Sciences"
DOI: 10.1007/s10958-018-3859-0
Abstract: A graph is called cyclically 4-edge-connected if removing any three edges from it results in a graph in which at most one connected component contains a cycle. A 3-connected graph is 4-edge-connected if and only… read more here.
Sign Up to like & get recommendations! 0
Published in 2018 at "Additive manufacturing"
DOI: 10.1016/j.addma.2018.06.007
Abstract: Abstract The spatial orientation of an object on a 3D printing plate is a significant contributor to its printing time. Thus, the speed of the 3D printing processes can generally be increased by using time-efficient… read more here.
Sign Up to like & get recommendations! 2
Published in 2023 at "Nonlinearity"
DOI: 10.1088/1361-6544/acc9a0
Abstract: We study a reinforcement process on graphs G of bounded degree. The model involves a parameter α > 0 governing the strength of reinforcement, and Poisson clock rates λ v at the vertices v of the graph.… read more here.
Sign Up to like & get recommendations! 0
Published in 2021 at "Royal Society Open Science"
DOI: 10.1098/rsos.201784
Abstract: Sequential region labelling, also known as connected components labelling, is a standard image segmentation problem that joins contiguous foreground pixels into blobs. Despite its long development history and widespread use across diverse domains such as… read more here.
Sign Up to like & get recommendations! 0
Published in 2020 at "IEEE Access"
DOI: 10.1109/access.2020.2971616
Abstract: Structural controllability of complex networks has been an attractive research area, and Minimum Inputs Theorem was proposed to identify the minimum driver nodes for complex networks with one-dimensional node dynamics. Then, the Minimum Inputs Theorem… read more here.
Sign Up to like & get recommendations! 1
Published in 2022 at "IEEE Transactions on Cybernetics"
DOI: 10.1109/tcyb.2022.3165550
Abstract: Multiview clustering has received great attention and numerous subspace clustering algorithms for multiview data have been presented. However, most of these algorithms do not effectively handle high-dimensional data and fail to exploit consistency for the… read more here.
Sign Up to like & get recommendations! 1
Published in 2022 at "PLOS ONE"
DOI: 10.1371/journal.pone.0277527
Abstract: With a cluster of commodity hardware, how can we efficiently find all connected components of an enormous graph containing hundreds of billions of nodes and edges? The problem of finding connected components has been used… read more here.