Sciweavers

4 search results - page 1 / 1
» Syntactic Pattern Recognition Using Finite Inductive Strings
Sort
View
PRIB
2009
Springer
13 years 10 months ago
Syntactic Pattern Recognition Using Finite Inductive Strings
A syntactic pattern recognition technique is described based upon a mathematical principle associated with finite sequences of symbols. The technique allows for fast recognition of...
Paul S. Fisher, Howard Fisher, Jinsuk Baek, Cleopa...
MCS
2008
Springer
13 years 5 months ago
Numerical optimal control of the wave equation: optimal boundary control of a string to rest in finite time
In many real-life applications of optimal control problems with constraints in form of partial differential equations (PDEs), hyperbolic equations are involved which typically desc...
Matthias Gerdts, Günter Greif, Hans Josef Pes...
CVIU
1999
104views more  CVIU 1999»
13 years 5 months ago
Interactively Matching Hand-Drawings Using Induction
In this paper we consider the task of matching patterns, as occur in hand-drawn symbols and schematic diagrams, by their parts and relationships. Of particular interest for comput...
Adrian R. Pearce, Terry Caelli
JCDL
2003
ACM
101views Education» more  JCDL 2003»
13 years 10 months ago
Bibliographic Attribute Extraction from Erroneous References Based on a Statistical Model
In this paper, we propose a method for extracting bibliographic attributes from reference strings captured using Optical Character Recognition (OCR) and an extended hidden Markov ...
Atsuhiro Takasu