7129 search results - page 471 / 1426 » Approximation Algorithms for Treewidth |
204
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NP-hard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. t...
176
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...
199
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...
170
click to vote
SOFSEM
2007
Springer
16 years 18 days 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...
173
click to vote
SOFSEM
2007
Springer
16 years 18 days 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 ...