450 search results - page 30 / 90 » The Complexity of Computing Minimal Unidirectional Covering ... |
CVPR
2010
IEEE
15 years 5 months ago
2010
IEEE
Sparse representation has found applications in numerous domains and recent developments have been focused on the convex relaxation of the 0-norm minimization for sparse coding (i...
102
click to vote
RECOMB
1997
Springer
15 years 4 months ago
1997
Springer
The paper studies the computational complexity and approximation algorithms for a new evolutionary distance between multi-chromosomal genomes introduced recently by Ferretti, Nade...
PR
2008
14 years 11 months ago
2008
This paper presents a novel set of geometric moments with symmetric kernel (SGM) obtained using an appropriate transformation of image coordinates. By using this image transformat...
ICALP
2005
Springer
15 years 5 months ago
2005
Springer
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
127
click to vote
STOC
2012
ACM
13 years 2 months ago
2012
ACM
We propose a new notion of secure multiparty computation aided by a computationally-powerful but untrusted “cloud” server. In this notion that we call on-the-fly multiparty c...