Sciweavers

421 search results - page 19 / 85
» String Distances and Uniformities
Sort
View
PDPTA
2003
13 years 8 months ago
Flexible Approximate String Matching Application on a Heterogeneous Distributed Environment
In this paper, we present three parallel flexible approximate string matching methods on a parallel architecture with heterogeneous workstations to gain supercomputer power at lo...
Panagiotis D. Michailidis, Konstantinos G. Margari...
ICPR
2002
IEEE
14 years 8 months ago
A Windowed Weighted Approach for Approximate Cyclic String Matching
A method for measuring dissimilarities between cyclic strings is introduced. It computes a weighted mean between two (lower and upper) bounds of the exact cyclic edit distance, wh...
Ramón Alberto Mollineda, Enrique Vidal, Fra...
ICIP
2007
IEEE
14 years 9 months ago
A Case-Based Reasoning Approach for Unknown Class Invoice Processing
This paper introduces an invoice analysis approach using CaseBased Reasoning (CBR). CBR is used to analyze and interpret new invoices thanks to the previous processing experiences...
Abdel Belaïd, Hatem Hamza, Yolande Belaï...
LACL
1998
Springer
13 years 11 months ago
Sequential Construction of Logical Forms
In this paper we give a formal description of the parsing model that underlies the treatment of Long Distance Dependencies, Topic and Focus, Ellipsis and Quantification in, amongs...
Wilfried Meyer-Viol
LATA
2009
Springer
13 years 12 months ago
Nested Counters in Bit-Parallel String Matching
Many algorithms, e.g. in the field of string matching, are based on handling many counters, which can be performed in parallel, even on a sequential machine, using bit-parallelism...
Kimmo Fredriksson, Szymon Grabowski