Sciweavers

224 search results - page 18 / 45
» Three New Algorithms for Regular Language Enumeration
Sort
View
84
Voted
PODS
2010
ACM
170views Database» more  PODS 2010»
15 years 2 months ago
A learning algorithm for top-down XML transformations
A generalization from string to trees and from languages to translations is given of the classical result that any regular language can be learned from examples: it is shown that ...
Aurélien Lemay, Sebastian Maneth, Joachim N...
FGR
2006
IEEE
134views Biometrics» more  FGR 2006»
15 years 1 months ago
Expanding Training Set for Chinese Sign Language Recognition
In Sign Language recognition, one of the problems is to collect enough training data. Almost all of the statistical methods used in Sign Language Recognition suffer from this prob...
Chunli Wang, Xilin Chen, Wen Gao
ACTAC
2006
126views more  ACTAC 2006»
14 years 9 months ago
Named Entity Recognition for Hungarian Using Various Machine Learning Algorithms
In this paper we introduce a statistical Named Entity recognizer (NER) system for the Hungarian language. We examined three methods for identifying and disambiguating proper nouns...
Richárd Farkas, György Szarvas, Andr&a...
PRL
2007
118views more  PRL 2007»
14 years 9 months ago
Unifying multi-class AdaBoost algorithms with binary base learners under the margin framework
Multi-class AdaBoost algorithms AdaBooost.MO, -ECC and -OC have received a great attention in the literature, but their relationships have not been fully examined to date. In this...
Yijun Sun, Sinisa Todorovic, Jian Li
PLDI
2011
ACM
14 years 10 days ago
The tao of parallelism in algorithms
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in “regularâ€...
Keshav Pingali, Donald Nguyen, Milind Kulkarni, Ma...