Results 11 to 20 of about 282,377 (316)
A Higher-Rank Mersenne Problem [PDF]
The classical Mersenne problem has been a stimulating challenge to number theorists and computer scientists for many years. After briefly reviewing some of the natural settings in which this problem appears as a special case, we introduce an analogue of the Mersenne problem in higher rank, in both a classical and an elliptic setting. Numerical evidence
Graham Everest +2 more
openaire +6 more sources
Estimating the minimal number of rank-1 tensors in the Canonical Polyadic Decomposition (CPD), known as the canonical rank, is a challenging area of research.
Ouafae Karmouda +2 more
doaj +1 more source
Reducing the rank of a matroid [PDF]
We consider the rank reduction problem for matroids: Given a matroid $M$ and an integer $k$, find a minimum size subset of elements of $M$ whose removal reduces the rank of $M$ by at least $k$. When $M$ is a graphical matroid this problem is the minimum $
Gwenaël Joret, Adrian Vetta
doaj +1 more source
Rank revealing‐based tensor completion using improved generalized tensor multi‐rank minimization
The authors address the problem of tensor completion from limited samplings. An improved generalized tubal Kronecker decomposition is first proposed to reveal the tensor structure of the targeted data, and the improved generalized tensor tubal‐rank and ...
Wei Z. Sun, Peng Zhang, Bo Zhao
doaj +1 more source
Multiple-rank modification of symmetric eigenvalue problem
Rank-1 modifications applied k-times (k > 1) often are performed to achieve a rank-k modification. We propose a rank- k modification for enhancing computational efficiency. As the first step toward a rank- k modification, an algorithm to perform a rank-2
HyungSeon Oh, Zhe Hu
doaj +1 more source
ORTP: A Video SAR Imaging Algorithm Based on Low-Tubal-Rank Tensor Recovery
Video synthetic aperture radar (SAR) is attracting more and more attention because of its continuous imaging capability for ground scene of interest under any weather conditions and any time of the day.
Wei Pu +3 more
doaj +1 more source
Approximate Message Passing for Structured Affine Rank Minimization Problem
The topic of the rank minimization problem with affine constraints has been well studied in recent years. However, in many applications the data can exhibit other structures beyond simply being low rank.
Yangqing Li +3 more
doaj +1 more source
Eliminating Rank Reversal Problem Using a New Multi-Attribute Model—The RAFSI Method
Multi-attribute decision-making (MADM) methods represent reliable ways to solve real-world problems for various applications by providing rational and logical solutions.
Mališa Žižović +4 more
doaj +1 more source
M-ary Rank Classifier Combination: A Binary Linear Programming Problem
The goal of classifier combination can be briefly stated as combining the decisions of individual classifiers to obtain a better classifier. In this paper, we propose a method based on the combination of weak rank classifiers because rankings contain ...
Vincent Vigneron, Hichem Maaref
doaj +1 more source

