Sciweavers

1700 search results - page 216 / 340
» Combinatorial Pattern Matching
Sort
View
IJFCS
2008
110views more  IJFCS 2008»
15 years 19 days ago
Indexing Gapped-Factors Using a Tree
We present a data structure to index a specific kind of factors, that is of substrings, called gapped-factors. A gapped-factor is a factor containing a gap that is ignored during ...
Pierre Peterlongo, Julien Allali, Marie-France Sag...
75
Voted
ENTCS
2007
96views more  ENTCS 2007»
15 years 18 days ago
Synchrony vs Asynchrony in Communication Primitives
We study, from the expressiveness point of view, the impact of synchrony in the communication primitives that arise when combining together some common and useful programming feat...
Daniele Gorla
SIAMCOMP
2008
121views more  SIAMCOMP 2008»
15 years 17 days 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 9 days 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
90
Voted
BMVC
2010
14 years 10 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