Sciweavers

151 search results - page 11 / 31
» Longest Common Pattern between two Permutations
Sort
View
CPM
2009
Springer
121views Combinatorics» more  CPM 2009»
14 years 2 months ago
LCS Approximation via Embedding into Local Non-repetitive Strings
A classical measure of similarity between strings is the length of the longest common subsequence(LCS) between the two given strings. The search for efficient algorithms for findi...
Gad M. Landau, Avivit Levy, Ilan Newman
BMCBI
2010
96views more  BMCBI 2010»
13 years 7 months ago
sdef: an R package to synthesize lists of significant features in related experiments
Background: In microarray studies researchers are often interested in the comparison of relevant quantities between two or more similar experiments, involving different treatments...
Marta Blangiardo, Alberto Cassese, Sylvia Richards...
ICIP
2007
IEEE
14 years 9 months ago
A HMM-Based Method for Recognizing Dynamic Video Contents from Trajectories
This paper describes an original method for classifying object motion trajectories in video sequences in order to recognize dynamic events. Similarities between trajectories are e...
Alexandre Hervieu, Patrick Bouthemy, Jean-Pierre L...
ICIP
2006
IEEE
14 years 9 months ago
A New Method for Boundary-Based Shape Matching and Retrieval
This paper presents a novel method for efficient boundary based shapes matching and retrieval in presence of occlusion. In this method, the geometric and topological information o...
Minh-Son Dao, Raffaele de Amicis
ICDE
2002
IEEE
143views Database» more  ICDE 2002»
14 years 8 months ago
Discovering Similar Multidimensional Trajectories
We investigate techniques for analysis and retrieval of object trajectories in a two or three dimensional space. Such kind of data usually contain a great amount of noise, that ma...
Michail Vlachos, Dimitrios Gunopulos, George Kolli...