Sciweavers

686 search results - page 60 / 138
» Minimax Probability Machine
Sort
View
IWCLS
2007
Springer
14 years 4 months ago
A Principled Foundation for LCS
In this paper we explicitly identify the probabilistic model underlying LCS by linking it to a generalisation of the common Mixture-of-Experts model. Having an explicit representa...
Jan Drugowitsch, Alwyn Barry
MLMI
2007
Springer
14 years 4 months ago
A Study of Phoneme and Grapheme Based Context-Dependent ASR Systems
In this paper we present a study of automatic speech recognition systems using context-dependent phonemes and graphemes as sub-word units based on the conventional HMM/GMM system a...
John Dines, Mathew Magimai-Doss
ICMLC
2005
Springer
14 years 3 months ago
Adaptive Online Multi-stroke Sketch Recognition Based on Hidden Markov Model
This paper presents a novel approach for adaptive online multi-stroke sketch recognition based on Hidden Markov Model (HMM). The method views the drawing sketch as the result of a ...
Zhengxing Sun, Wei Jiang, Jianyong Sun
ESA
2003
Springer
93views Algorithms» more  ESA 2003»
14 years 3 months ago
Improved Bounds for Finger Search on a RAM
We present a new finger search tree with O(1) worst-case update time and O(log log d) expected search time with high probability in the Random Access Machine (RAM) model of comput...
Alexis C. Kaporis, Christos Makris, Spyros Sioutas...
ICML
2000
IEEE
14 years 2 months ago
Discriminative Reranking for Natural Language Parsing
This paper considers approaches which rerank the output of an existing probabilistic parser. The base parser produces a set of candidate parses for each input sentence, with assoc...
Michael Collins