Sciweavers

8298 search results - page 26 / 1660
» On the Complexity of Numerical Analysis
Sort
View
ICDAR
2003
IEEE
15 years 3 months ago
Improvement of Matching and Evaluation in Handwritten Numeral Recognition Using Flexible Standard Patterns
The purpose of this study is to develop a flexible matching method for recognizing handwritten numerals based on the statistics of shapes and structures learned from learning sam...
Hirokazu Muramatsu, Takashi Kobayashi, Takahiro Su...
67
Voted
ICDAR
2003
IEEE
15 years 3 months ago
Shape Matching Using GAT Correlation against Nonlinear Distortion and its Application to Handwritten Numeral Recognition
This paper addresses the problem of to what extent linear transformation can alleviate nonlinear distortion. We investigate a technique of global affine transformation (GAT) corre...
Toru Wakahara
CIMCA
2008
IEEE
15 years 4 months ago
Space Based Architecture for Numerical Solving
A strategy for the analytical solving of ordinary differential equations and a first implementation of it based on mobile agent community, using jini javaspace framework, are pre...
Cyril Dumont, Fabrice Mourlin
IJFCS
2008
49views more  IJFCS 2008»
14 years 9 months ago
A Markovian Approach for the Analysis of the gene Structure
Hidden Markov models (HMMs) are effective tools to detect series of statistically homogeneous structures, but they are not well suited to analyse complex structures. Numerous meth...
Christelle Melo de Lima, Laurent Gueguen, Christia...
TCOM
2010
111views more  TCOM 2010»
14 years 8 months ago
Design of irregular LDPC codes with optimized performance-complexity tradeoff
—The optimal performance-complexity tradeoff for error-correcting codes at rates strictly below the Shannon limit is a central question in coding theory. This paper proposes a nu...
Benjamin Smith, Masoud Ardakani, Wei Yu, Frank R. ...