Results 221 to 230 of about 33,631 (264)
Some of the next articles are maybe not open access.
Acta Numerica, 2006
In this survey we discuss properties of specific methods of approximation that belong to a family of greedy approximation methods (greedy algorithms). It is now well understood that we need to study nonlinear sparse representations in order to significantly increase our ability to process (compress, denoise,etc.) large data sets. Sparse representations
openaire +1 more source
In this survey we discuss properties of specific methods of approximation that belong to a family of greedy approximation methods (greedy algorithms). It is now well understood that we need to study nonlinear sparse representations in order to significantly increase our ability to process (compress, denoise,etc.) large data sets. Sparse representations
openaire +1 more source
SIAM Journal on Computing, 1991
Summary: Scheduling packets to be forwarded over a link is an important subtask of the routing process in both parallel computing and in communication networks. This paper investigates the simple class of greedy scheduling algorithms, namely, algorithm that always forward a packet if they can.
Cidon, Israel +3 more
openaire +2 more sources
Summary: Scheduling packets to be forwarded over a link is an important subtask of the routing process in both parallel computing and in communication networks. This paper investigates the simple class of greedy scheduling algorithms, namely, algorithm that always forward a packet if they can.
Cidon, Israel +3 more
openaire +2 more sources
Mathematical Notes, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Archives of Dermatology, 1994
As much as I enjoyed Crawshaw's 1 article on physician greed, I am sick and tired of hearing about ''bad apples'' in the medical profession. The ''bad apple'' philosophy presumes that while most physicians are ethical, there are a few among us who are morally impaired—the ''money grubbers,'' the ''greedy''—who constitute the problem and ''we'' have to ...
openaire +3 more sources
As much as I enjoyed Crawshaw's 1 article on physician greed, I am sick and tired of hearing about ''bad apples'' in the medical profession. The ''bad apple'' philosophy presumes that while most physicians are ethical, there are a few among us who are morally impaired—the ''money grubbers,'' the ''greedy''—who constitute the problem and ''we'' have to ...
openaire +3 more sources
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
Theoretical Computer Science, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rongxing Xu, Xuding Zhu
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rongxing Xu, Xuding Zhu
openaire +2 more sources
Greedy by Chance - Stochastic Greedy Algorithms
2010 Sixth International Conference on Autonomic and Autonomous Systems, 2010For many complex combinatorial optimization problems, obtaining good solutions quickly is of value either by itself or as part of an exact algorithm. Greedy algorithms to obtain such solutions are known for many problems. In this paper we present stochastic greedy algorithms which are perturbed versions of standard greedy algorithms, and report on ...
Viswanathan Kodaganallur, Anup K. Sen
openaire +1 more source
Proceedings of the 6th ACM international symposium on Advances in geographic information systems, 1998
We propose advancing-front techniques for the problem of simplification of dense digitized terrain models. While most simplification algorithms have been based on either incremental refinement or decimation techniques, our Greedy-Cuts algorithms use a simple triangulationgrowth procedure. They work by taking greedy cuts (“bites”) out of a simple closed
Cláudio T. Silva, Joseph S. B. Mitchell
openaire +1 more source
We propose advancing-front techniques for the problem of simplification of dense digitized terrain models. While most simplification algorithms have been based on either incremental refinement or decimation techniques, our Greedy-Cuts algorithms use a simple triangulationgrowth procedure. They work by taking greedy cuts (“bites”) out of a simple closed
Cláudio T. Silva, Joseph S. B. Mitchell
openaire +1 more source
ACM Transactions on Embedded Computing Systems, 2016
Commodity solid state drives (SSDs) have recently begun involving the adoption of powerful controllers for multichannel flash management at the page level. However, many of these models still use primitive garbage-collection algorithms, because previous approaches are subject to poor scalability with high-capacity flash memory.
Li-Pin Chang, Yu-Syun Liu, Wen-Huei Lin
openaire +1 more source
Commodity solid state drives (SSDs) have recently begun involving the adoption of powerful controllers for multichannel flash management at the page level. However, many of these models still use primitive garbage-collection algorithms, because previous approaches are subject to poor scalability with high-capacity flash memory.
Li-Pin Chang, Yu-Syun Liu, Wen-Huei Lin
openaire +1 more source
European Journal of Sociology, 1967
Organized groups are always faced with the problem of how best to harness human energies to their purposes. They must concern themselves with mechanisms which insure that people are sufficiently motivated to be loyal to them even in the face of competing appeals from other sources within the wider social structure.
openaire +1 more source
Organized groups are always faced with the problem of how best to harness human energies to their purposes. They must concern themselves with mechanisms which insure that people are sufficiently motivated to be loyal to them even in the face of competing appeals from other sources within the wider social structure.
openaire +1 more source