Sciweavers

513 search results - page 77 / 103
» Finitely Based, Finite Sets of Words
Sort
View
CORR
2000
Springer
116views Education» more  CORR 2000»
14 years 11 months ago
Algorithmic Statistics
While Kolmogorov complexity is the accepted absolute measure of information content of an individual finite object, a similarly absolute notion is needed for the relation between a...
Péter Gács, John Tromp, Paul M. B. V...
ASC
2011
14 years 6 months ago
A note on the learning automata based algorithms for adaptive parameter selection in PSO
: PSO, like many stochastic search methods, is very sensitive to efficient parameter setting such that modifying a single parameter may cause a considerable change in the result. I...
Ali B. Hashemi, Mohammad Reza Meybodi
CVPR
2004
IEEE
16 years 1 months ago
Wide Baseline Feature Matching Using the Cross-Epipolar Ordering Constraint
? Robust feature matching across different views of the same scene taken by two cameras with wide baseline and arbitrary rotation is still an open problem. Matching based on appear...
Xiaoye Lu, Roberto Manduchi
NOLISP
2005
Springer
15 years 5 months ago
MLP Internal Representation as Discriminative Features for Improved Speaker Recognition
Feature projection by non-linear discriminant analysis (NLDA) can substantially increase classification performance. In automatic speech recognition (ASR) the projection provided b...
Dalei Wu, Andrew C. Morris, Jacques C. Koreman
FORTEST
2008
15 years 1 months ago
Testing Data Types Implementations from Algebraic Specifications
Algebraic specifications of data types provide a natural basis for testing data types implementations. In this framework, the conformance relation is based on the satisfaction of a...
Marie-Claude Gaudel, Pascale Le Gall