Sciweavers

2089 search results - page 20 / 418
» A New Problem in String Searching
Sort
View
CORR
2010
Springer
185views Education» more  CORR 2010»
14 years 12 months ago
A new exponential separation between quantum and classical one-way communication complexity
We present a new example of a partial boolean function whose one-way quantum communication complexity is exponentially lower than its one-way classical communication complexity. T...
Ashley Montanaro
GFKL
2005
Springer
142views Data Mining» more  GFKL 2005»
15 years 5 months ago
Near Similarity Search and Plagiarism Analysis
Abstract. Existing methods to text plagiarism analysis mainly base on “chunking”, a process of grouping a text into meaningful units each of which gets encoded by an integer nu...
Benno Stein, Sven Meyer zu Eissen
PAMI
2002
157views more  PAMI 2002»
14 years 11 months ago
Automatic Recognition of Handwritten Numerical Strings: A Recognition and Verification Strategy
A modular system to recognize handwritten numerical strings is proposed. It uses a segmentation-based recognition approach and a Recognition and Verification strategy. The approach...
Luiz E. Soares de Oliveira, Robert Sabourin, Fl&aa...
SPIRE
2010
Springer
14 years 10 months ago
String Matching with Variable Length Gaps
We consider string matching with variable length gaps. Given a string T and a pattern P consisting of strings separated by variable length gaps (arbitrary strings of length in a sp...
Philip Bille, Inge Li Gørtz, Hjalte Wedel V...
SIGMOD
2008
ACM
142views Database» more  SIGMOD 2008»
15 years 12 months ago
Cost-based variable-length-gram selection for string collections to support approximate queries efficiently
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
Xiaochun Yang, Bin Wang, Chen Li