Sciweavers

195 search results - page 21 / 39
» Detecting Word Substitutions in Text
Sort
View
FUIN
2010
89views more  FUIN 2010»
13 years 8 months ago
Computing Maximal Error-detecting Capabilities and Distances of Regular Languages
Abstract. A (combinatorial) channel consists of pairs of words representing all possible inputoutput channel situations. In a past paper, we formalized the intuitive concept of “...
Stavros Konstantinidis, Pedro V. Silva
CPM
1993
Springer
125views Combinatorics» more  CPM 1993»
14 years 1 months ago
Detecting False Matches in String Matching Algorithms
Consider a text string of length n, a pattern string of length m, and a match vector of length n which declares each location in the text to be either a mismatch (the pattern does ...
S. Muthukrishnan
CPM
2005
Springer
100views Combinatorics» more  CPM 2005»
13 years 11 months ago
Hardness of Optimal Spaced Seed Design
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
François Nicolas, Eric Rivals
LREC
2010
150views Education» more  LREC 2010»
13 years 11 months ago
Detection of Peculiar Examples using LOF and One Class SVM
This paper proposes the method to detect peculiar examples of the target word from a corpus. The peculiar example is regarded as an outlier in the given example set. Therefore we ...
Hiroyuki Shinnou, Minoru Sasaki
ICIP
2009
IEEE
13 years 7 months ago
Semantic keyword extraction via adaptive text binarization of unstructured unsourced video
We propose a fully automatic method for summarizing and indexing unstructured presentation videos based on text extracted from the projected slides. We use changes of text in the ...
Michele Merler, John R. Kender