Sciweavers

516 search results - page 18 / 104
» Sets of k-Independent Strings
Sort
View
WWW
2004
ACM
14 years 8 months ago
Web data integration using approximate string join
Web data integration is an important preprocessing step for web mining. It is highly likely that several records on the web whose textual representations differ may represent the ...
Yingping Huang, Gregory R. Madey
STOC
2002
ACM
99views Algorithms» more  STOC 2002»
14 years 7 months ago
Recognizing string graphs in NP
A string graph is the intersection graph of a set of curves in the plane. Each curve is represented by a vertex, and an edge between two vertices means that the corresponding curv...
Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic
CPM
2005
Springer
206views Combinatorics» more  CPM 2005»
14 years 1 months ago
A Fast Algorithm for Approximate String Matching on Gene Sequences
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
Zheng Liu, Xin Chen, James Borneman, Tao Jiang
ICPR
2002
IEEE
14 years 8 months ago
A Windowed Weighted Approach for Approximate Cyclic String Matching
A method for measuring dissimilarities between cyclic strings is introduced. It computes a weighted mean between two (lower and upper) bounds of the exact cyclic edit distance, wh...
Ramón Alberto Mollineda, Enrique Vidal, Fra...
JMIV
2006
130views more  JMIV 2006»
13 years 7 months ago
Alternative 2D Shape Representations using the Symmetry Set
Among the many attempts made to represent families of 2D shapes in a simpler way, the Medial Axis (MA) takes a prominent place. Its graphical representation is intuitively appealin...
Arjan Kuijper, Ole Fogh Olsen, Peter J. Giblin, Ma...