Sciweavers

470 search results - page 39 / 94
» Using Unknown Word Techniques to Learn Known Words
Sort
View
ICDAR
2003
IEEE
14 years 2 months ago
Optimizing Binary Feature Vector Similarity Measure using Genetic Algorithm and Handwritten Character Recognition
Classifying an unknown input is a fundamental problem in pattern recognition. A common method is to define a distance metric between patterns and find the most similar pattern i...
Sung-Hyuk Cha, Charles C. Tappert, Sargur N. Sriha...
BMVC
2010
13 years 7 months ago
Learning Directional Local Pairwise Bases with Sparse Coding
Recently, sparse coding has been receiving much attention in object and scene recognition tasks because of its superiority in learning an effective codebook over k-means clusterin...
Nobuyuki Morioka, Shin'ichi Satoh
GECCO
2007
Springer
212views Optimization» more  GECCO 2007»
14 years 3 months ago
A developmental model of neural computation using cartesian genetic programming
The brain has long been seen as a powerful analogy from which novel computational techniques could be devised. However, most artificial neural network approaches have ignored the...
Gul Muhammad Khan, Julian F. Miller, David M. Hall...
SPIRE
1998
Springer
14 years 1 months ago
An Experiment Stemming Non-Traditional Text
Stemming is a technique which aims to extract common suffixes of words. Thus, words which are literally differhave a common stem, may be abstracted by their common stem. The under...
Mario A. Nascimento, Adriano C. R. da Cunha
CHES
2005
Springer
107views Cryptology» more  CHES 2005»
14 years 2 months ago
A New Baby-Step Giant-Step Algorithm and Some Applications to Cryptanalysis
We describe a new variant of the well known Baby-Step Giant-Step algorithm in the case of some discrete logarithms with a special structure. More precisely, we focus on discrete lo...
Jean-Sébastien Coron, David Lefranc, Guilla...