Sciweavers

46 search results - page 2 / 10
» Variable Word Rate N-grams
Sort
View
MP
2011
13 years 1 months ago
A first-order interior-point method for linearly constrained smooth optimization
Abstract: We propose a first-order interior-point method for linearly constrained smooth optimization that unifies and extends first-order affine-scaling method and replicator d...
Paul Tseng, Immanuel M. Bomze, Werner Schachinger
ICDAR
2003
IEEE
13 years 11 months ago
Learning the lexicon from raw texts for open-vocabulary Korean word recognition
In this paper, we propose a novel method of building a language model for open-vocabulary Korean word recognition. Due to the complex morphology of Korean, it is inappropriate to ...
Sungho Ryu, Jin Hyung Kim
ICAPR
2001
Springer
13 years 10 months ago
A Time-Length Constrained Level Building Algorithm for Large Vocabulary Handwritten Word Recognition
In this paper we introduce a constrained Level Building Algorithm (LBA) in order to reduce the search space of a Large Vocabulary Handwritten Word Recognition (LVHWR) system. A ti...
Alessandro L. Koerich, Robert Sabourin, Ching Y. S...
IJON
2007
134views more  IJON 2007»
13 years 6 months ago
Analysis of SVM regression bounds for variable ranking
This paper addresses the problem of variable ranking for Support Vector Regression. The relevance criteria that we proposed are based on leave-one-out bounds and some variants and...
Alain Rakotomamonjy
SIAMJO
2008
79views more  SIAMJO 2008»
13 years 6 months ago
A Class of Inexact Variable Metric Proximal Point Algorithms
For the problem of solving maximal monotone inclusions, we present a rather general class of algorithms, which contains hybrid inexact proximal point methods as a special case and ...
Lisandro A. Parente, Pablo A. Lotito, Mikhail V. S...