Sciweavers

92 search results - page 2 / 19
» Maximal repetitions in strings
Sort
View
IPL
2008
93views more  IPL 2008»
13 years 4 months ago
Computing Longest Previous Factor in linear time and applications
We give two optimal linear-time algorithms for computing the Longest Previous Factor (LPF) array corresponding to a string w. For any position i in w, LPF[i] gives the length of th...
Maxime Crochemore, Lucian Ilie
JDA
2008
87views more  JDA 2008»
13 years 4 months ago
Lossless filter for multiple repetitions with Hamming distance
Similarity search in texts, notably in biological sequences, has received substantial attention in the last few years. Numerous filtration and indexing techniques have been create...
Pierre Peterlongo, Nadia Pisanti, Fréd&eacu...
ICMCS
2006
IEEE
99views Multimedia» more  ICMCS 2006»
13 years 11 months ago
Counting of Video Clip Repetitions using a Modified BMH Algorithm: Preliminary Results
In this work, we cope with the problem of identifying the number of repetitions of a specific video clip in a target video clip. Generally, the methods that deal with this proble...
Silvio Jamil Ferzoli Guimarães, Renata Rodr...
CODES
2008
IEEE
13 years 6 months ago
Guaranteed scheduling for repetitive hard real-time tasks under the maximal temperature constraint
We study the problem of scheduling repetitive real-time tasks with the Earliest Deadline First (EDF) policy that can guarantee the given maximal temperature constraint. We show th...
Gang Quan, Yan Zhang, William Wiles, Pei Pei
SPIRE
2010
Springer
13 years 3 months ago
Counting and Verifying Maximal Palindromes
Abstract. A palindrome is a symmetric string that reads the same forward and backward. Let Pals(w) denote the set of maximal palindromes of a string w in which each palindrome is r...
Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayu...