Results 21 to 30 of about 6,215,927 (306)
Empirical and Philosophical Problems with the Subspecies Rank
Species-level taxonomy is derived from methodological sources (data and techniques) that assess the existence of spatio-temporal evolutionary lineages via various species concepts. These concepts determine if observed lineages are independent given a particular methodology supposedly connected to ontology, which relates the metaphysical concept to what
Frank T. Burbrink +6 more
openaire +3 more sources
Sparse and low-rank decomposition (SLRD) poses a big challenge in many fields. The existing methods are used to solve SLRD problem via formulating approximations of sparse and low-rank matrices.
Zhenzhen Yang, Zhen Yang, Deren Han
doaj +1 more source
Quantum-Inspired Hierarchy for Rank-Constrained Optimization
Many problems in information theory can be reduced to optimizations over matrices, where the rank of the matrices is constrained. We establish a link between rank-constrained optimization and the theory of quantum entanglement.
Xiao-Dong Yu +3 more
doaj +1 more source
The augmented lagrange multipliers method for matrix completion from corrupted samplings with application to mixed Gaussian-impulse noise removal. [PDF]
This paper studies the problem of the restoration of images corrupted by mixed Gaussian-impulse noise. In recent years, low-rank matrix reconstruction has become a research hotspot in many scientific and engineering domains such as machine learning ...
Fan Meng, Xiaomei Yang, Chenghu Zhou
doaj +1 more source
Low-rank sparse subspace clustering with a clean dictionary
Low-Rank Representation (LRR) and Sparse Subspace Clustering (SSC) are considered as the hot topics of subspace clustering algorithms. SSC induces the sparsity through minimizing the l 1 -norm of the data matrix while LRR promotes a low-rank structure ...
Cong-Zhe You, Zhen-Qiu Shu, Hong-Hui Fan
doaj +1 more source
The tensor rank problem over the quaternions [PDF]
24 pages, no ...
Y.G. Liang, Sergio Da Silva, Yang Zhang
openaire +2 more sources
A New Technique in Rank Metric Code-Based Encryption
We propose a rank metric codes based encryption based on the hard problem of rank syndrome decoding problem. We propose a new encryption with a public key matrix by considering the adding of a random distortion matrix over F q m of full column ...
Terry Shue Chien Lau, Chik How Tan
doaj +1 more source
Feature selection is known to be an applicable solution to address the problem of high dimensionality in software defect prediction (SDP). However, choosing an appropriate filter feature selection (FFS) method that will generate and guarantee optimal ...
Abdullateef O. Balogun +7 more
doaj +1 more source
Good intermediate-rank lattice rules based on the weighted star discrepancy [PDF]
We study the problem of constructing good intermediate-rank lattice rules in the sense of having a low weighted star discrepancy. The intermediate-rank rules considered here are obtained by “copying” rank-1 lattice rules.
Joe, Stephen, Sinescu, Vasile
core +1 more source

