Sciweavers

541 search results - page 19 / 109
» An Efficient Algorithm for the Longest Pattern Subsequence P...
Sort
View
DPHOTO
2009
154views Hardware» more  DPHOTO 2009»
13 years 6 months ago
Optimal color filter array design: quantitative conditions and an efficient search procedure
Most digital cameras employ a spatial subsampling process, implemented as a color filter array (CFA), to capture color images. The choice of CFA patterns has a great impact on the...
Yue M. Lu, Martin Vetterli
STRINGOLOGY
2004
13 years 10 months ago
A Note on Bit-Parallel Alignment Computation
Abstract. The edit distance between strings A and B is defined as the minimum number of edit operations needed in converting A into B or vice versa. Typically the allowed edit oper...
Heikki Hyyrö
DAC
2004
ACM
14 years 2 months ago
Area-efficient instruction set synthesis for reconfigurable system-on-chip designs
Silicon compilers are often used in conjunction with Field Programmable Gate Arrays (FPGAs) to deliver flexibility, fast prototyping, and accelerated time-to-market. Many of these...
Philip Brisk, Adam Kaplan, Majid Sarrafzadeh
ICPR
2004
IEEE
14 years 10 months ago
Direct Condensing: An Efficient Voronoi Condensing Algorithm for Nearest Neighbor Classifiers
Voronoi condensing reduces training patterns of nearest neighbor classifiers without changing the classification boundaries. This method plays important roles not only in the near...
Takekazu Kato, Toshikazu Wada
CPM
2009
Springer
121views Combinatorics» more  CPM 2009»
14 years 3 months ago
LCS Approximation via Embedding into Local Non-repetitive Strings
A classical measure of similarity between strings is the length of the longest common subsequence(LCS) between the two given strings. The search for efficient algorithms for findi...
Gad M. Landau, Avivit Levy, Ilan Newman