Sciweavers

514 search results - page 4 / 103
» Approximate Periods of Strings
Sort
View
GEOINFO
2007
13 years 9 months ago
Approximate String Matching for Geographic Names and Personal Names
The problem of matching strings allowing errors has recently gained importance, considering the increasing volume of online textual data. In geotechnologies, approximate string mat...
Clodoveu A. Davis, Emerson de Salles
DASFAA
2009
IEEE
136views Database» more  DASFAA 2009»
14 years 2 months ago
A Two-Tire Index Structure for Approximate String Matching with Block Moves
Many applications need to solve the problem of approximate string matching with block moves. It is an NP-Complete problem to compute block edit distance between two strings. Our go...
Bin Wang, Long Xie, Guoren Wang
ICCV
2005
IEEE
14 years 9 months ago
Periodic Motion Detection and Segmentation via Approximate Sequence Alignment
A method for detecting and segmenting periodic motion is presented. We exploit periodicity as a cue and detect periodic motion in complex scenes where common methods for motion se...
Ivan Laptev, Josh Wills, Patrick Pérez, Ser...
COCOON
2010
Springer
13 years 11 months ago
A Three-String Approach to the Closest String Problem
Given a set of n strings of length L and a radius d, the closest string problem (CSP for short) asks for a string tsol that is within a Hamming distance of d to each of the given ...
Zhi-Zhong Chen, Bin Ma, Lusheng Wang
ALMOB
2006
97views more  ALMOB 2006»
13 years 8 months ago
The approximability of the String Barcoding problem
The String Barcoding (SBC) problem, introduced by Rash and Gusfield (RECOMB, 2002), consists in finding a minimum set of substrings that can be used to distinguish between all mem...
Giuseppe Lancia, Romeo Rizzi