Sciweavers

3270 search results - page 40 / 654
» Approximate String Processing
Sort
View
SODA
2010
ACM
181views Algorithms» more  SODA 2010»
13 years 6 months ago
Near-Optimal Sublinear Time Algorithms for Ulam Distance
We give near-tight bounds for estimating the edit distance between two non-repetitive strings (Ulam distance) with constant approximation, in sub-linear time. For two strings of l...
Alexandr Andoni, Huy L. Nguyen
SAC
2006
ACM
14 years 1 months ago
An implicit segmentation-based method for recognition of handwritten strings of characters
This paper describes an implicit segmentation-based method for recognition of strings of characters (words or numerals). In a two-stage HMM-based method, an implicit segmentation ...
Paulo Rodrigo Cavalin, Alceu de Souza Britto Jr., ...
HPDC
1998
IEEE
13 years 12 months ago
Strings: A High-Performance Distributed Shared Memory for Symmetrical Multiprocessor Clusters
This paper introduces Strings, a high performance distributed shared memory system designed for clusters of symmetrical multiprocessors (SMPs). The distinguishing feature of this ...
Sumit Roy, Vipin Chaudhary
GI
2010
Springer
13 years 6 months ago
Toward an adaptive String Similarity Measure for Matching Product Offers
: Product matching aims at identifying different product offers referring to the same real-world product. Product offers are provided by different merchants and describe products u...
Andreas Thor
ICIAP
2009
ACM
13 years 5 months ago
Video Event Classification Using Bag of Words and String Kernels
Abstract. The recognition of events in videos is a relevant and challenging task of automatic semantic video analysis. At present one of the most successful frameworks, used for ob...
Lamberto Ballan, Marco Bertini, Alberto Del Bimbo,...