Sciweavers

2610 search results - page 29 / 522
» The Recognition Strategy Language
Sort
View
GRAMMARS
2000
100views more  GRAMMARS 2000»
13 years 9 months ago
Tabulation of Automata for Tree-Adjoining Languages
Abstract. We propose a modular design of tabular parsing algorithms for treeadjoining languages. The modularity is made possible by a separation of the parsing strategy from the me...
Miguel A. Alonso, Mark-Jan Nederhof, Eric Villemon...
IEEEICCI
2007
IEEE
14 years 4 months ago
A Simple High Accuracy Approach for Face Recognition
— The theory that Electoral College is more stable than Direct Popular Vote is applied in face recognition. By simplly adopting most traditional PCA approach, the experiments in ...
Liang Chen, Naoyuki Tokuda
GRC
2005
IEEE
14 years 3 months ago
An evolution strategy for the induction of fuzzy finite-state automata
: This study presents an evolution strategy used to infer fuzzy finite-state automata from examples of a fuzzy language. We describe the fitness function of an generated automata w...
Zhiwen Mo, Min Wan, Lan Shu
ICGI
2000
Springer
14 years 1 months ago
Computation of Substring Probabilities in Stochastic Grammars
Abstract. The computation of the probability of string generation according to stochastic grammars given only some of the symbols that compose it underlies pattern recognition prob...
Ana L. N. Fred
MCS
2009
Springer
14 years 4 months ago
Ensemble Strategies for Classifying Hyperspectral Remote Sensing Data
The classification of hyperspectral imagery, using multiple classifier systems is discussed and an SVM-based ensemble is introduced. The data set is separated into separate featu...
Xavier Ceamanos, Björn Waske, Jon Atli Benedi...