Results 41 to 50 of about 2,883,021 (288)

Low frequency groans indicate larger and more dominant fallow deer (Dama dama) males. [PDF]

open access: yesPLoS 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

Hyperspectral Image Denoising Using Global Weighted Tensor Norm Minimum and Nonlocal Low-Rank Approximation

open access: yesRemote 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

open access: yesEURASIP 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

The minimum rank problem over the finite field of order 2: Minimum rank 3

open access: yesLinear 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

On the minimum vector rank of multigraphs [PDF]

open access: yesThe Electronic Journal of Linear Algebra, 2010
The minimum vector rank (mvr) of a graph over a field F is the smallest d for which a faithful vector representation of G exists in F d . For simple graphs, minimum semidefinite rank (msr) and minimum vector rank differ by exactly the number of isolated vertices.
Mitchell, Lon   +2 more
openaire   +2 more sources

Robust Tensor Factorization for Color Image and Grayscale Video Recovery

open access: yesIEEE 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

A Single-Image Noise Estimation Algorithm Based on Pixel-Level Low-Rank Low-Texture Patch and Principal Component Analysis

open access: yesSensors, 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 of Typical Fooling-Set Matrices [PDF]

open access: yes, 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

On the minimum skew rank of graphs [PDF]

open access: yesScienceAsia, 2014
The minimum skew rank mr (F;G) of a graphG over a field F is the smallest possible rank among all skew symmetric matrices over F whose (i;j)th entry (for i 6 j) is non-zero whenever ij is an edge in G and is zero otherwise. We characterize the graphs G with cut vertices over an infinite field F such that mr (F;G) = 4 determine the minimum skew rank of ...
Yanna Wang, Bo Zhou
openaire   +1 more source

An Improving Approach for Top-Rank- Frequent Pattern Mining

open access: yesVietnam Journal of Computer Science, 2022
Mining frequent patterns (FPs) received a lot of research interest which is a fundamental problem in the field of data mining. It has been studied on many database types with various applications in intelligent systems.
Ham Nguyen
doaj   +1 more source

Home - About - Disclaimer - Privacy