Results 71 to 80 of about 14,497 (259)
This paper proposes a novel control framework to ensure safety of a robotic swarm. A feedback optimization controller is capable of driving the swarm toward a target density while keeping risk‐zone exposure below a safety threshold. Theory and experiments show how safety is more effectively achieved for sparsely connected swarms.
Longchen Niu, Gennaro Notomista
wiley +1 more source
A bound for the permanent of the Laplacian matrix
Let L(G) be D-A where D is the diagonal matrix of vertex degrees and A the adjacency matrix. The author proves by an explicit formula that the permanent of L is at least 2(n-1)k where k, the complexity, is the number of spanning trees.
openaire +1 more source
Interlacing Properties of Eigenvalues of Laplacian and Net-Laplacian Matrix of Signed Graphs
This paper explores interlacing inequalities in the Laplacian spectrum of signed cycles and investigates interlacing relationship between the spectrum of the net-Laplacian of a signed graph and its subgraph formed by removing a vertex together with its incident edges.
Guragain, Satyam, Srivastava, Ravi
openaire +2 more sources
Four decades of retinal vessel segmentation research (1982–2025) are synthesized, spanning classical image processing, machine learning, and deep learning paradigms. A meta‐analysis of 428 studies establishes a unified taxonomy and highlights performance trends, generalization capabilities, and clinical relevance.
Avinash Bansal +6 more
wiley +1 more source
This paper presents a high‐speed object pose estimation method that deconstructs objects into geometric components. Inspired by human cognitive generalization, it detects these primitives and infers the 6D pose from their stable spatial configuration.
Xuyang Li +6 more
wiley +1 more source
Spectral properties of edge Laplacian matrix
Let $N(X)$ be the Laplacian matrix of a directed graph obtained from the edge adjacency matrix of a graph $X.$ In this work, we study the bipartiteness property of the graph with the help of $N(X).$ We computed the spectrum of the edge Laplacian matrix for the regular graphs, the complete bipartite graphs, and the trees.
Chauhan, Shivani +1 more
openaire +3 more sources
Visual features, numerical descriptors, and controlled textual attributes extracted from smartphone images of Chenpi are integrated by VALIANT, a tailored multimodal framework for simultaneous storage‐age classification and authenticity verification. The workflow distinguishes genuine products from suspicious standard operating procedure mimics while ...
Simon C. K. Chan +5 more
wiley +1 more source
Normalized Laplacian spectrum of some subdivision-joins and R-joins of two regular graphs
In this paper we determine the full normalized Laplacian spectrum of the subdivision-vertex join, subdivision-edge join, R-vertex join, and R-edge join of two regular graphs in terms of the normalized Laplacian eigenvalues of the graphs.
Arpita Das, Pratima Panigrahi
doaj +1 more source
Single‐cell Spatial Transcriptomics Analysis and Denoising Engine is introduced as a unified deep learning framework that jointly performs denoising, clustering, and gene prioritization in spatial transcriptomics. By integrating linear and nonlinear representations within a dual‐channel architecture, it improves robustness and accuracy, uncovers ...
Yaxuan Cui +11 more
wiley +1 more source
On distance signless Laplacian spectrum and energy of graphs
The distance signless Laplacian spectral radius of a connected graph G is the largest eigenvalue of the distance signless Laplacian matrix of G, defined as DQ(G) = Tr(G) + D(G), where D(G) is the distance matrix of G and Tr(G) is the diagonal ...
Abdollah Alhevaz +2 more
doaj +1 more source

