7930 search results - page 610 / 1586 » Greedy in Approximation Algorithms |
190
click to vote
ICIP
2006
IEEE
16 years 8 months ago
2006
IEEE
For the non-local denoising approach presented by Buades et al., remarkable denoising results are obtained at high expense of computational cost. In this paper, a new algorithm th...
214
click to vote
ICASSP
2009
IEEE
16 years 1 months ago
2009
IEEE
Iterative shrinkage of sparse and redundant representations are at the heart of many state of the art denoising and deconvolution algorithms. They assume the signal is well approx...
200
click to vote
SOFSEM
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. After text retrieval, the next waves in web searching and multimedia retrieval are the search for and delivery of images, music, video, and 3D scenes. Not only the percep...
204
click to vote
SOFSEM
2007
Springer
16 years 1 months ago
2007
Springer
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...
171
click to vote
CIKM
2004
Springer
16 years 18 days ago
2004
Springer
Mining massive temporal data streams for significant trends, emerging buzz, and unusually high or low activity is an important problem with several commercial applications. In th...