Sciweavers

1862 search results - page 225 / 373
» Constrained pattern matching
Sort
View
SIAMCOMP
2008
121views more  SIAMCOMP 2008»
15 years 3 months ago
Closest Substring Problems with Small Distances
We study two pattern matching problems that are motivated by applications in computational biology. In the Closest Substring problem k strings s1, . . ., sk are given, and the tas...
Dániel Marx
PR
2002
112views more  PR 2002»
15 years 3 months ago
Finding approximate palindromes in strings
We introduce a novel de nition of approximate palindromes in strings, and provide an algorithm to nd all maximal approximate palindromes in a string with up to k errors. Our de ni...
Alexandre H. L. Porto, Valmir C. Barbosa
BMVC
2010
15 years 1 months ago
Pairwise Macropixel Comparison Can Work at Least as Well as Advanced Holistic Algorithms for Face Recognition
It is well known that, due to illumination effects and the registration/alignment problem, it does not make sense to compare the "values" of two single-pixels for face r...
Liang Chen
IMCSIT
2010
15 years 1 months ago
TREF - TRanslation Enhancement Framework for Japanese-English
Abstract--We present a method for improving existing statistical machine translation methods using an knowledge-base compiled from a bilingual corpus as well as sequence alignment ...
Bartholomäus Wloka, Werner Winiwarter
ENTCS
2011
120views more  ENTCS 2011»
14 years 9 months ago
Game Semantics for Quantum Data
This paper presents a game semantics for a simply-typed λ-calculus with qbits constants and associated quantum operations. The resulting language is expressive enough to encode a...
Yannick Delbecque