The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
A conventional color histogram (CCH) considers neither the color similarity across different bins nor the color dissimilarity in the same bin. Therefore, it is sensitive to noisy i...
Accurate grouping of video shots could lead to semantic indexing of video segments for content analysis and retrieval. This paper introduces a novel cluster analysis which, depend...
— Serious efforts to develop computerized systems for natural language understanding and machine translation have taken place for more than half a century. Some successful system...
The most suitable method for the automated classification of protein structures remains an open problem in computational biology. In order to classify a protein structure with an...