Results 221 to 230 of about 17,132 (259)
Some of the next articles are maybe not open access.
Biorthogonal Greedy Algorithms in convex optimization
Applied and Computational Harmonic Analysis, 2022Anton Dereventsov
exaly
2001
In a separable Hilbert space $\cal H$, greedy algorithms iteratively define $m$-term approximants to a given vector $f$ from a complete redundant dictionary $\cal D$. With very large dictionaries, the pure greedy algorithm cannot be implemented and must be replaced with a weak greedy algorithm which is defined through a weakness sequence $t_m \in [0,1],
openaire +1 more source
In a separable Hilbert space $\cal H$, greedy algorithms iteratively define $m$-term approximants to a given vector $f$ from a complete redundant dictionary $\cal D$. With very large dictionaries, the pure greedy algorithm cannot be implemented and must be replaced with a weak greedy algorithm which is defined through a weakness sequence $t_m \in [0,1],
openaire +1 more source
Fast Greedy Algorithms in MapReduce and Streaming
ACM Transactions on Parallel Computing, 2015Ravi Kumar
exaly