324 search results - page 15 / 65 » Guessing based on length functions |
STOC
2009
ACM
14 years 8 months ago
2009
ACM
Algebraic codes that achieve list decoding capacity were recently constructed by a careful "folding" of the Reed-Solomon code. The "low-degree" nature of this f...
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
We propose a global optimization framework for 3D shape reconstruction from sparse noisy 3D measurements frequently encountered in range scanning, sparse featurebased stereo, and ...
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
We consider the problem of learning a similarity function from a set of positive equivalence constraints, i.e. 'similar' point pairs. We define the similarity in informa...
JCP
2008
13 years 7 months ago
2008
This paper presents a high throughput VLSI architecture for Blackman windowing. Since most of the implementation of windowing functions for real time applications, are based on eit...
JDA
2008
13 years 7 months ago
2008
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, ...