Results 1 to 10 of about 756,826 (263)
Compressive Sensing via Nonlocal Smoothed Rank Function. [PDF]
PLoS ONE, 2016 Compressive sensing (CS) theory asserts that we can reconstruct signals and images with only a small number of samples or measurements. Recent works exploiting the nonlocal similarity have led to better results in various CS studies.
Ya-Ru Fan +3 more
doaj +2 more sources
Beyond Zipf's Law: The Lavalette Rank Function and Its Properties. [PDF]
PLoS ONE, 2016 Although Zipf's law is widespread in natural and social data, one often encounters situations where one or both ends of the ranked data deviate from the power-law function.
Oscar Fontanelli +4 more
doaj +2 more sources
Tensor Completion via Smooth Rank Function Low-Rank Approximate Regularization
Remote Sensing, 2023 In recent years, the tensor completion algorithm has played a vital part in the reconstruction of missing elements within high-dimensional remote sensing image data.
Shicheng Yu +5 more
doaj +3 more sources
Subspace Segmentation by Low Rank Representation via the Sparse-Prompting Quasi-Rank Function
IEEE Access, 2022 In this paper, a general optimization formulation is proposed for the subspace segmentation by low rank representation via the sparse-prompting quasi-rank function.
Haiyang Li +5 more
doaj +3 more sources
Dual Artificial Variable-Free Simplex Algorithm for Solving Neutrosophic Linear Programming Problems [PDF]
Neutrosophic Sets and Systems, 2021 This paper presents a simplified form of dual simplex algorithm for solving linear programming problems with fuzzy and neutrosophic numbers which supplies some great benefits over phase 1 of traditional dual simplex algorithm.
Aya Rabie +3 more
doaj +1 more source
Information Inequalities via Submodularity and a Problem in Extremal Graph Theory
Entropy, 2022 The present paper offers, in its first part, a unified approach for the derivation of families of inequalities for set functions which satisfy sub/supermodularity properties.
Igal Sason
doaj +1 more source
Ranks with Respect to a Projective Variety and a Cost-Function
AppliedMath, 2022 Let X⊂Pr be an integral and non-degenerate variety. A “cost-function” (for the Zariski topology, the semialgebraic one, or the Euclidean one) is a semicontinuous function w:=[1,+∞)∪+∞ such that w(a)=1 for a non-empty open subset of X.
Edoardo Ballico
doaj +1 more source
A Unified Scalable Equivalent Formulation for Schatten Quasi-Norms
Mathematics, 2020 The Schatten quasi-norm is an approximation of the rank, which is tighter than the nuclear norm. However, most Schatten quasi-norm minimization (SQNM) algorithms suffer from high computational cost to compute the singular value decomposition (SVD) of ...
Fanhua Shang +5 more
doaj +1 more source
Eventual linear ranking functions [PDF]
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming, 2013 Program termination is a hot research topic in program analysis. The last few years have witnessed the development of termination analyzers for programming languages such as C and Java with remarkable precision and performance. These systems are largely based on techniques and tools coming from the field of declarative constraint programming.
BAGNARA, Roberto, MESNARD F.
openaire +3 more sources
A Nonconvex Method to Low-Rank Matrix Completion
IEEE Access, 2022 In recent years, the problem of recovering a low-rank matrix from partial entries, known as low-rank matrix completion problem, has attracted much attention in many applications.
Haizhen He +3 more
doaj +1 more source