Sciweavers

1696 search results - page 49 / 340
» Permuted function matching
Sort
View
SPIRE
2004
Springer
15 years 3 months ago
Longest Motifs with a Functionally Equivalent Central Block
This paper presents a generalization of the notion of longest repeats with a block of k don’t care symbols introduced by [8] (for k fixed) to longest motifs composed of three pa...
Maxime Crochemore, Raffaele Giancarlo, Marie-Franc...
SODA
2010
ACM
163views Algorithms» more  SODA 2010»
15 years 7 months ago
Geometric optimization and sums of algebraic functions
We present a new optimization technique that yields the first FPTAS for several geometric problems. These problems reduce to optimizing a sum of non-negative, constant description...
Antoine Vigneron
SSC
2007
Springer
126views Cryptology» more  SSC 2007»
15 years 4 months ago
Randomness and Representation of Span n Sequences
Any span n sequences can be regarded as filtering sequences. From this observation, new randomness criteria for span n sequences are proposed. It is proved that the feedback funct...
Guang Gong
COR
1999
99views more  COR 1999»
14 years 9 months ago
Applications of modern heuristic search methods to pattern sequencing problems
This article describes applications of modern heuristic search methods to pattern sequencing problems, i.e., problems seeking for a permutation of the rows of a given matrix with r...
Andreas Fink, Stefan Voß
SODA
1997
ACM
169views Algorithms» more  SODA 1997»
14 years 11 months ago
Partial Matching of Planar Polylines Under Similarity Transformations
Given two planar polylines T and P with n and m edges, respectively, we present an Om2 n2  time, Omn space algorithm to nd portions of the text" T which are similar in sh...
Scott D. Cohen, Leonidas J. Guibas