Sciweavers

6289 search results - page 291 / 1258
» Error Sequence Analysis
Sort
View
CORR
2004
Springer
111views Education» more  CORR 2004»
15 years 6 months ago
Finding Approximate Palindromes in Strings Quickly and Simply
: Described are two algorithms to find long approximate palindromes in a string, for example a DNA sequence. A simple algorithm requires O(n)space and almost always runs in O(k.n)-...
L. Allison
BMVC
2001
15 years 9 months ago
Zernike Velocity Moments for Description and Recognition of Moving Shapes
New Zernike velocity moments have been developed to describe an object, not only by its shape , but also by its motion throughout an image sequence. These are an extended form of ...
Jamie D. Shutler, Mark S. Nixon
ACL
2006
15 years 8 months ago
A Bio-Inspired Approach for Multi-Word Expression Extraction
This paper proposes a new approach for Multi-word Expression (MWE)extraction on the motivation of gene sequence alignment because textual sequence is similar to gene sequence in p...
Jianyong Duan, Ruzhan Lu, Weilin Wu, Yi Hu, Yan Ti...
DAS
2010
Springer
15 years 11 months ago
Analysis of whole-book recognition
Whole-book recognition is a document image analysis strategy that operates on the complete set of a book’s page images, attempting to improve accuracy by automatic unsupervised ...
Pingping Xiu, Henry S. Baird
DCC
2005
IEEE
16 years 6 months ago
Efficient String Matching Algorithms for Combinatorial Universal Denoising
Inspired by the combinatorial denoising method DUDE [13], we present efficient algorithms for implementing this idea for arbitrary contexts or for using it within subsequences. We...
S. Chen, Suhas N. Diggavi, Sanket Dusad, S. Muthuk...