Sciweavers

318 search results - page 12 / 64
» A New Indexing Method for Approximate String Matching
Sort
View
WEA
2007
Springer
125views Algorithms» more  WEA 2007»
15 years 3 months ago
Simple Compression Code Supporting Random Access and Fast String Matching
Given a sequence S of n symbols over some alphabet Σ, we develop a new compression method that is (i) very simple to implement; (ii) provides O(1) time random access to any symbol...
Kimmo Fredriksson, Fedor Nikitin
VLDB
2007
ACM
105views Database» more  VLDB 2007»
15 years 3 months ago
Extending Q-Grams to Estimate Selectivity of String Matching with Low Edit Distance
There are many emerging database applications that require accurate selectivity estimation of approximate string matching queries. Edit distance is one of the most commonly used s...
Hongrae Lee, Raymond T. Ng, Kyuseok Shim
IPPS
2003
IEEE
15 years 2 months ago
Approximate Search Engine Optimization for Directory Service
Today, in many practical E-Commerce systems, the real stored data usually are short strings, such as names, addresses, or other information. Searching data within these short stri...
Kai-Hsiang Yang, Chi-Chien Pan, Tzao-Lin Lee
ICDE
2008
IEEE
157views Database» more  ICDE 2008»
15 years 10 months ago
TALE: A Tool for Approximate Large Graph Matching
Abstract-- Large graph datasets are common in many emerging database applications, and most notably in large-scale scientific applications. To fully exploit the wealth of informati...
Yuanyuan Tian, Jignesh M. Patel
DRR
2004
14 years 12 months ago
A nonparametric classifier for unsegmented text
Symbolic Indirect Correlation (SIC) is a new classification method for unsegmented patterns. SIC requires two levels of comparisons. First, the feature sequences from an unknown q...
George Nagy, Ashutosh Joshi, Mukkai S. Krishnamoor...