Sciweavers

686 search results - page 81 / 138
» Minimax Probability Machine
Sort
View
GECCO
2011
Springer
236views Optimization» more  GECCO 2011»
13 years 18 days ago
Online, GA based mixture of experts: a probabilistic model of ucs
In recent years there have been efforts to develop a probabilistic framework to explain the workings of a Learning Classifier System. This direction of research has met with lim...
Narayanan Unny Edakunni, Gavin Brown, Tim Kovacs
ICALP
2009
Springer
14 years 9 months ago
B-Treaps: A Uniquely Represented Alternative to B-Trees
We present the first uniquely represented data structure for an external memory model of computation, a B-tree analogue called a B-treap. Uniquely represented data structures repre...
Daniel Golovin
ICASSP
2009
IEEE
14 years 3 months ago
Joint map adaptation of feature transformation and Gaussian Mixture Model for speaker recognition
This paper extends our previous work on feature transformationbased support vector machines for speaker recognition by proposing a joint MAP adaptation of feature transformation (...
Donglai Zhu, Bin Ma, Haizhou Li
TAMC
2009
Springer
14 years 3 months ago
Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata
Priced Probabilistic Timed Automata (PPTA) extend timed automata with cost-rates in locations and discrete probabilistic branching. The model is a natural combination of Priced Tim...
Jasper Berendsen, Taolue Chen, David N. Jansen
ICPR
2008
IEEE
14 years 3 months ago
Pre-extracting method for SVM classification based on the non-parametric K-NN rule
With the increase of the training set’s size, the efficiency of support vector machine (SVM) classifier will be confined. To solve such a problem, a novel preextracting method f...
Deqiang Han, Chongzhao Han, Yi Yang, Yu Liu, Wenta...