450 search results - page 30 / 90 » The Complexity of Computing Minimal Unidirectional Covering ... |
173
click to vote
CVPR
2010
IEEE
16 years 6 days 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...
182
click to vote
RECOMB
1997
Springer
15 years 10 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...
170
click to vote
PR
2008
15 years 6 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...
150
click to vote
ICALP
2005
Springer
16 years 2 days 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 ...
205
click to vote
STOC
2012
ACM
13 years 9 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...