Sciweavers

421 search results - page 17 / 85
» String Distances and Uniformities
Sort
View
CORR
2000
Springer
149views Education» more  CORR 2000»
13 years 7 months ago
On The Closest String and Substring Problems
Abstract. The problem of finding a center string that is "close" to every given string arises in computational molecular biology and coding theory. This problem has two v...
Ming Li, Bin Ma, Lusheng Wang
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,...
IWOCA
2009
Springer
132views Algorithms» more  IWOCA 2009»
14 years 1 months ago
Fast Convolutions and Their Applications in Approximate String Matching
We develop a method for performing boolean convolutions efficiently in word RAM model of computation, having a word size of w = Ω(log n) bits, where n is the input size. The tech...
Kimmo Fredriksson, Szymon Grabowski
CPM
1999
Springer
141views Combinatorics» more  CPM 1999»
13 years 11 months ago
Approximate Periods of Strings
The study of approximately periodic strings is relevant to diverse applications such as molecular biology, data compression, and computer-assisted music analysis. Here we study di...
Jeong Seop Sim, Costas S. Iliopoulos, Kunsoo Park,...
ICDAR
1999
IEEE
13 years 11 months ago
Partitioning and Searching Dictionary for Correction of Optically Read Devanagari Character Strings
Abstract. This paper describes a method for correction of optically read Devanagari character strings using a Hindi word dictionary. The word dictionary is partitioned in order to ...
Veena Bansal, R. M. K. Sinha