Sciweavers

2638 search results - page 207 / 528
» Extracting Approximate Patterns
Sort
View
APPROX
2004
Springer
117views Algorithms» more  APPROX 2004»
15 years 12 months ago
The Greedy Algorithm for the Minimum Common String Partition Problem
In the Minimum Common String Partition problem (MCSP) we are given two strings on input, and we wish to partition them into the same collection of substrings, minimizing the numbe...
Marek Chrobak, Petr Kolman, Jiri Sgall
ICASSP
2010
IEEE
15 years 6 months ago
A non-iterative estimator for the concentration parameter of the relative phase distribution
In this paper, we propose an approximation of the relative phase probability function (RP pdf) and use it to find a non-iterative estimator for the concentration parameter of the...
Yothin Rakvongthai, Soontorn Oraintara
TNN
2008
119views more  TNN 2008»
15 years 6 months ago
Selecting Useful Groups of Features in a Connectionist Framework
Abstract--Suppose for a given classification or function approximation (FA) problem data are collected using sensors. From the output of the th sensor, features are extracted, ther...
Debrup Chakraborty, Nikhil R. Pal
CICLING
2006
Springer
15 years 10 months ago
Automatic Acquisition of Semantic-Based Question Reformulations for Question Answering
Abstract. In this paper, we present a method for the automatic acquisition of semantic-based reformulations from natural language questions. Our goal is to find useful and generic ...
Jamileh Yousefi, Leila Kosseim
CPM
2005
Springer
100views Combinatorics» more  CPM 2005»
15 years 8 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