Results 21 to 30 of about 332,055 (262)
Graphs with large rank numbers and rank numbers of subdivided stars
AKCE International Journal of Graphs and Combinatorics, 2020 A -ranking of a graph is a function such that if then every path contains a vertex such that . The rank number of , denoted , is the minimum such that a -ranking exists for .
Hayley Boynton +3 more
doaj +1 more source
Minimum Distance Tests and Estimates Based on Ranks
Revstat Statistical Journal, 2020 It is well known that the least squares estimate in classical linear regression model is very sensitive to violation of the assumptions, in particular normality of model errors.
Radim Navrátil
doaj +1 more source
Low frequency groans indicate larger and more dominant fallow deer (Dama dama) males. [PDF]
PLoS ONE, 2008 BACKGROUND: Models of honest advertisement predict that sexually selected calls should signal male quality. In most vertebrates, high quality males have larger body sizes that determine higher social status and in turn higher reproductive success ...
Elisabetta Vannoni, Alan G McElligott
doaj +1 more source
Remote Sensing, 2019 A hyperspectral image (HSI) contains abundant spatial and spectral information, but it is always corrupted by various noises, especially Gaussian noise.
Xiangyang Kong +3 more
doaj +1 more source
Research on correction algorithm of propagation error in wireless sensor network coding
EURASIP Journal on Wireless Communications and Networking, 2020 It is very difficult to deal with the problem of error correction in random network coding, especially when the number of errors is more than the min-cut of the network. We combine a small field with rank-metric codes to solve this problem in this paper.
Dongqiu Zhang +3 more
doaj +1 more source
Sensors, 2022 Noise level is an important parameter for image denoising in many image-processing applications. We propose a noise estimation algorithm based on pixel-level low-rank, low-texture subblocks and principal component analysis for white Gaussian noise. First,
Yong Li +3 more
doaj +1 more source
The minimum rank problem over the finite field of order 2: Minimum rank 3
Linear Algebra and its Applications, 2009 Our main result is a sharp bound for the number of vertices in a minimal forbidden subgraph for the graphs having minimum rank at most 3 over the finite field of order 2. We also list all 62 such minimal forbidden subgraphs. We conclude by exploring how some of these results over the finite field of order 2 extend to arbitrary fields and demonstrate ...
Barrett, Wayne +2 more
openaire +2 more sources
Robust Tensor Factorization for Color Image and Grayscale Video Recovery
IEEE Access, 2020 Low-rank tensor completion (LRTC) plays an important role in many fields, such as machine learning, computer vision, image processing, and mathematical theory.
Shiqiang Du +4 more
doaj +1 more source
The (Minimum) Rank of Typical Fooling-Set Matrices [PDF]
, 2017 A fooling-set matrix has nonzero diagonal, but at least one in every pair of diagonally opposite entries is 0. Dietzfelbinger et al. '96 proved that the rank of such a matrix is at least $\sqrt n$. It is known that the bound is tight (up to a multiplicative constant). We ask for the "typical" minimum rank of a fooling-set matrix: For a fooling-set zero-
Mozhgan Pourmoradnasseri +1 more
openaire +2 more sources
An Insight to Estimated Item Response Matrix in Item Response Theory
IEEE Access, 2023 This paper investigates the performance of item response theory based on distance criteria rather than likelihood criteria. For this purpose, the estimated item response matrix is introduced.
Hideo Hirose
doaj +1 more source