Results 251 to 260 of about 1,645,700 (287)
Some of the next articles are maybe not open access.
The Thresholding Greedy Algorithm, Greedy Bases, and Duality
Constructive Approximation, 2003Let \(X\) be a Banach space with a normalized basis \((e_n)\) and biorthogonal functionals \((e_n^*)\) and let \(x\in X\). Order the nonzero scalars \(e_n^*(x)\) by decreasing the modulus (if \(| e_n^*(x)| =| e_m^*(x)| \) and ...
Dilworth, S. J. +3 more
openaire +2 more sources
Matroids and the greedy algorithm
Mathematical Programming, 1971Linear-algebra rank is the solution to an especially tractable optimization problem. This tractability is viewed abstractly, and extended to certain more general optimization problems which are linear programs relative to certain derived polyhedra.
openaire +1 more source
Adv. Comput. Math., 2000
Theoretical aspects of the efficiency of \(M\)-term approximation is studied for ``weak'' greedy algorithms. These are defined by weaker assumptions than their known analogs: the pure greedy algorithm, an orthogonal greedy algorithm, and a relaxed greedy algorithm. Convergence theorems and rates of approximation by these algorithms are proved.
openaire +2 more sources
Theoretical aspects of the efficiency of \(M\)-term approximation is studied for ``weak'' greedy algorithms. These are defined by weaker assumptions than their known analogs: the pure greedy algorithm, an orthogonal greedy algorithm, and a relaxed greedy algorithm. Convergence theorems and rates of approximation by these algorithms are proved.
openaire +2 more sources
Greedy Algorithm for Attribute Reduction
Fundamenta Informaticae, 2008In the paper the accuracy of greedy algorithmfor construction of partial tests (superreducts) and partial decision rules is considered. Results of experiments with greedy algorithm are described.
Beata Zielosko, Marcin Piliszczuk
openaire +3 more sources
A greedy algorithm for sparse unmixing
2018 26th Signal Processing and Communications Applications Conference (SIU), 2018Hyperspectral imaging sensors provide image data containing both spatial and detailed spectral information. However, due to low spatial resolution, the pixels in hyperspectral images are actually mixtures of the spectral signatures of the materials. Sparse unmixing assumes that these mixed pixels are sparse linear combinations of different material ...
Yuksel, Seniha Esen +1 more
openaire +3 more sources
Greedy in Approximation Algorithms
2006The objective of this paper is to characterize classes of problems for which a greedy algorithm finds solutions provably close to optimum. To that end, we introduce the notion of k-extendible systems, a natural generalization of matroids, and show that a greedy algorithm is a 1/k-factor approximation for these systems.
openaire +2 more sources
1995
We consider the selection of two basketball teams at a neighborhood playground to illustrate the greedy method. Usually the top two players are designated captains. All other players line up while the captains alternate choosing one player at a time. Usually, the players are picked using a greedy strategy.
Raymond Greenlaw +2 more
openaire +1 more source
We consider the selection of two basketball teams at a neighborhood playground to illustrate the greedy method. Usually the top two players are designated captains. All other players line up while the captains alternate choosing one player at a time. Usually, the players are picked using a greedy strategy.
Raymond Greenlaw +2 more
openaire +1 more source
Biorthogonal Greedy Algorithms in Convex Optimization
Applied and Computational Harmonic Analysis, 2022Anton Dereventsov, V N Temlyakov
exaly