Results 11 to 20 of about 464,627 (312)
Exponential Graph Regularized Non-Negative Low-Rank Factorization for Robust Latent Representation
Mathematics, 2022 Non-negative matrix factorization (NMF) is a fundamental theory that has received much attention and is widely used in image engineering, pattern recognition and other fields.
Guowei Yang, Lin Zhang, Minghua Wan
doaj +2 more sources
On the K-theory of higher rank graph C*-algebras [PDF]
, 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
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 +3 more
doaj +2 more sources
A Note on Brill–Noether Theory and Rank-Determining Sets for Metric Graphs [PDF]
International Mathematics Research Notices, 2012 We produce open subsets of the moduli space of metric graphs without separating edges where the dimensions of Brill‐Noether loci are larger than the corresponding Brill‐Noether numbers. These graphs also have minimal rank-determining sets that are larger than expected, giving counterexamples to a conjecture of Luo.
Chang Mou Lim +2 more
openalex +2 more sources
Publicacions Matemàtiques, 2023 We unite elements of category theory, K-theory, and geometric group theory, by defining a class of groups called $k$-cube groups, which act freely and transitively on the product of $k$ trees, for arbitrary $k$. The quotient of this action on the product of trees defines a $k$-dimensional cube complex, which induces a higher-rank graph.
Sam A. Mutter +2 more
openalex +5 more sources
Asymptotic tensor rank of graph tensors: beyond matrix multiplication [PDF]
Computational Complexity, 2016 We present an upper bound on the exponent of the asymptotic behaviour of the tensor rank of a family of tensors defined by the complete graph on k vertices.
M. Christandl +2 more
semanticscholar +6 more sources
Improved Gilbert-Varshamov bound for sum-rank-metric codes via graph theory [PDF]
We use a graph-theoretic approach which yields improvements on the known Gilbert-Varshamov (GV) bound for sum-rank-metric codes for certain parameters. In particular, we show that asymptotically $\mathbb{F}_q^{\mathbf{n} \times \mathbf{m}}$ can be partitioned into sum-rank-metric codes whose average size is bigger than the GV bound by a logarithmic ...
Aida Abiad +2 more
openalex +3 more sources
Perron-Frobenius theory and KMS states on higher-rank graph C*-Algebras
, 2019 In this thesis, we study the Perron-Frobenius theory for irreducible matrices and irreducible family of commuting matrices in detail. We then apply it to study the KMS states of the $C^*$-algebras of $ k $-graphs. To be more precise, we define the Toeplitz algebra $ \mathcal{T}C^{*}(\Lambda) $ and $C^*$-algebra $ C^{*}(\Lambda) $ for a $ k $-graph ...
Samandeep Singh
openalex +3 more sources
Scientific ReportsGroup 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 +7 more
doaj +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