2254 search results - page 267 / 451 » Computing the minimal covering set |
159
click to vote
ECCC
2006
15 years 6 months ago
2006
We investigate the computational complexity of finding an element of a permutation group H Sn with a minimal distance to a given Sn, for different metrics on Sn. We assume that...
160
click to vote
TC
2008
15 years 6 months ago
2008
Multimedia applications usually have throughput constraints. An implementation must meet these constraints, while it minimizes resource usage and energy consumption. The compute in...
156
click to vote
TIP
2008
15 years 6 months ago
2008
We present a fast variational deconvolution algorithm that minimizes a quadratic data term subject to a regularization on the 1 -norm of the wavelet coefficients of the solution. ...
267
click to vote
TMI
1998
15 years 6 months ago
1998
—In this paper implicit representations of deformable models for medical image enhancement and segmentation are considered. The advantage of implicit models over classical explic...
247
click to vote
CVPR
2011
IEEE
15 years 3 months ago
2011
IEEE
This paper presents an algorithm for order reduction of
factors in High-Order Markov Random Fields (HOMRFs).
Standard techniques for transforming arbitrary high-order
factors in...