Results 21 to 30 of about 1,255,341 (210)

Hyperspectral Anomaly Detection via Graph Dictionary-Based Low Rank Decomposition with Texture Feature Extraction

Remote Sensing, 2020
The accuracy of anomaly detection in hyperspectral images (HSIs) faces great challenges due to the high dimensionality, redundancy of data, and correlation of spectral bands.
Shangzhen Song, Yixin Yang, Huixin Zhou, Jonathan Cheung-Wai Chan   +3 more
doaj   +2 more sources

Graph Spectral Properties of Deterministic Finite Automata [PDF]

arXiv, 2014
We prove that a minimal automaton has a minimal adjacency matrix rank and a minimal adjacency matrix nullity using equitable partition (from graph spectra theory) and Nerode partition (from automata theory). This result naturally introduces the notion of matrix rank into a regular language L, the minimal adjacency matrix rank of a deterministic ...
A. Goldberg, A. Nerode, C. Choffrut, J. Sakarovitch, P.V. Mieghem, S.M. Osnaga   +5 more
arxiv   +3 more sources

Wavelets and graph $C^*$-algebras [PDF]

arXiv, 2016
Here we give an overview on the connection between wavelet theory and representation theory for graph $C^{\ast}$-algebras, including the higher-rank graph $C^*$-algebras of A. Kumjian and D. Pask. Many authors have studied different aspects of this connection over the last 20 years, and we begin this paper with a survey of the known results.
A. Jonsson, A. Kumjian, A. Kumjian, A. Kumjian, A. Kumjian, A. Kumjian, A. Sims, A. Sims, A. Skalski, C. Farsi, C. Farthing, D. Dutkay, D. Hammond, D. Hammond, D. Pask, D. Pask, D. Pask, D. Pask, D. Pask, D.E. Dutkay, D.E. Dutkay, D.G. Evans, D.I. Robertson, D.I. Robertson, D.W. Kribs, F.K. Chung, G. Robertson, G. Robertson, I. Raeburn, J. Spielberg, J.E. Hutchinson, K.R. Davidson, K.R. Davidson, M. Marcolli, N. Brownlowe, O. Bratteli, R. Strichartz, S. Mallat, S. Power, T. Carlsen   +39 more
arxiv   +3 more sources

On the K-theory of higher rank graph C*-algebras

, 2004
Given a row-finite $k$-graph $ $ with no sources we investigate the $K$-theory of the higher rank graph $C^*$-algebra, $C^*( )$. When $k=2$ we are able to give explicit formulae to calculate the $K$-groups of $C^*( )$. The $K$-groups of $C^*( )$ for $k>2$ can be calculated under certain circumstances and we consider the case $k=3$. We prove that
D. Gwion Evans
openalex   +4 more sources

Rank-two 5d SCFTs from M-theory at isolated toric singularities: a systematic study [PDF]

Journal of High Energy Physics, 2020
We carry out a detailed exploration of the deformations of rank-two five-dimensional superconformal field theories (SCFTs) T X $$ {\mathcal{T}}_{\mathbf{X}} $$ , which are geometrically engineered by M-theory on the space transverse to isolated toric ...
Vivek Saxena
doaj   +2 more sources

Identifying Influential Nodes Based on Evidence Theory in Complex Network [PDF]

Entropy
Influential node identification is an important and hot topic in the field of complex network science. Classical algorithms for identifying influential nodes are typically based on a single attribute of nodes or the simple fusion of a few attributes ...
Fu Tan, Xiaolong Chen, Rui Chen, Ruijie Wang, Chi Huang, Shimin Cai   +5 more
doaj   +2 more sources

An intuitionistic fuzzy graph’s variation coefficient measure with application to selecting a reliable alliance partner [PDF]

Scientific Reports
Group decision-making (GDM) is crucial in various components of graph theory, management science, and operations research. In particular, in an intuitionistic fuzzy group decision-making problem, the experts communicate their preferences using ...
Naveen Kumar Akula, Sharief Basha S, Nainaru Tarakaramu, Obbu Ramesh, Sameh Askar, Uma Maheswari Rayudu, Hijaz Ahmad, M. Ijaz Khan   +7 more
doaj   +2 more sources

On the K-theory of twisted higher-rank-graph C*-algebras [PDF]

, 2012
Alex Kumjian, David Pask, Aidan Sims
semanticscholar   +4 more sources

Dilation theory for rank two graph algebras.

, 2010
An analysis is given of $*$-representations of rank 2 single vertex graphs. We develop dilation theory for the non-selfadjoint algebras $\A_\theta$ and $\A_u$ which are associated with the commutation relation permutation $\theta$ of a 2-graph and, more generally, with commutation relations determined by a unitary matrix $u$ in $M_m(\bC) \otimes M_n ...
Kenneth R. Davidson, S. C. Power, Dilian Yang   +2 more
openalex   +2 more sources

The treewidth of 2-section of hypergraphs [PDF]

Discrete Mathematics & Theoretical Computer Science, 2021
Let $H=(V,F)$ be a simple hypergraph without loops. $H$ is called linear if $|f\cap g|\le 1$ for any $f,g\in F$ with $f\not=g$. The $2$-section of $H$, denoted by $[H]_2$, is a graph with $V([H]_2)=V$ and for any $ u,v\in V([H]_2)$, $uv\in E([H]_2)$ if ...
Ke Liu, Mei Lu
doaj   +1 more source