Sciweavers

4137 search results - page 73 / 828
» On the number of matchings of a tree
Sort
View
CPM
1999
Springer
127views Combinatorics» more  CPM 1999»
15 years 6 months ago
A New Indexing Method for Approximate String Matching
We present a new indexing method for the approximate string matching problem. The method is based on a su x tree combined with a partitioning of the pattern. We analyze the resulti...
Gonzalo Navarro, Ricardo A. Baeza-Yates
FCT
2005
Springer
15 years 7 months ago
A New Linearizing Restriction in the Pattern Matching Problem
In the pattern matching problem, there can be a quadratic number of matching substrings in the size of a given text. The linearizing restriction finds, at most, a linear number of...
Yo-Sub Han, Derick Wood
ICDE
2008
IEEE
137views Database» more  ICDE 2008»
16 years 3 months ago
XML Prefiltering as a String Matching Problem
We propose a new technique for the efficient search and navigation in XML documents and streams. This technique takes string matching algorithms designed for efficient keyword sear...
Christoph Koch, Stefanie Scherzinger, Michael Schm...
MM
2004
ACM
78views Multimedia» more  MM 2004»
15 years 7 months ago
Indexing and matching of polyphonic songs for query-by-singing system
This paper investigates the issues in polyphonic popular song retrieval. The problems that we consider include singing voice extraction, melodic curve representation, and database...
Tat-Wan Leung, Chong-Wah Ngo
SSPR
2004
Springer
15 years 7 months ago
An Optimal Probabilistic Graphical Model for Point Set Matching
We present a probabilistic graphical model for point set matching. By using a result about the redundancy of the pairwise distances in a point set, we represent the binary relation...
Tibério S. Caetano, Terry Caelli, Dante Aug...