Sciweavers

Share
ICASSP
2011
IEEE
8 years 5 months ago
Integrating articulatory features using Kullback-Leibler divergence based acoustic model for phoneme recognition
In this paper, we propose a novel framework to integrate articulatory features (AFs) into HMM- based ASR system. This is achieved by using posterior probabilities of different AFs...
Ramya Rasipuram, Magimai.-Doss Mathew
CORR
2011
Springer
143views Education» more  CORR 2011»
8 years 5 months ago
Probabilistic Logic: Many-valuedness and Intensionality
The probability theory is a well-studied branch of mathematics, in order to carry out formal reasoning about probability. Thus, it is important to have a logic, both for computati...
Zoran Majkic
ACS
2011
8 years 8 months ago
The Compositional Construction of Markov Processes
We describe an algebra for composing automata in which the actions have probabilities. We illustrate by showing how to calculate the probability of reaching deadlock in k steps in...
Luisa de Francesco Albasini, Nicoletta Sabadini, R...
ICCAD
2009
IEEE
87views Hardware» more  ICCAD 2009»
8 years 11 months ago
The synthesis of combinational logic to generate probabilities
As CMOS devices are scaled down into the nanometer regime, concerns about reliability are mounting. Instead of viewing nanoscale characteristics as an impediment, technologies suc...
Weikang Qian, Marc D. Riedel, Kia Bazargan, David ...
ICST
2010
IEEE
9 years 2 days ago
Generating Transition Probabilities for Automatic Model-Based Test Generation
—Markov chains with Labelled Transitions can be used to generate test cases in a model-based approach. These test cases are generated by random walks on the model according to pr...
Abderrahmane Feliachi, Hélène Le Gue...
RC
2007
64views more  RC 2007»
9 years 1 months ago
Unimodality, Independence Lead to NP-Hardness of Interval Probability Problems
In many real-life situations, we only have partial information about probabilities. This information is usually described by bounds on moments, on probabilities of certain events,...
Daniel Berleant, Olga Kosheleva, Vladik Kreinovich...
ALGORITHMICA
1998
81views more  ALGORITHMICA 1998»
9 years 1 months ago
The List Update Problem: Improved Bounds for the Counter Scheme
We consider the problem of dynamic reorganization of a linear list, where requests for the elements are generated randomly with fixed, unknown probabilities. The objective is to ...
Hadas Shachnai, Micha Hofri
MANSCI
2007
85views more  MANSCI 2007»
9 years 1 months ago
Probability Elicitation, Scoring Rules, and Competition Among Forecasters
Probability forecasters who are rewarded via a proper scoring rule may care not only about the score, but also about their performance relative to other forecasters. We model this...
Kenneth C. Lichtendahl Jr., Robert L. Winkler
AI
2004
Springer
9 years 1 months ago
Updating beliefs with incomplete observations
Currently, there is renewed interest in the problem, raised by Shafer in 1985, of updating probabilities when observations are incomplete (or set-valued). This is a fundamental pro...
Gert de Cooman, Marco Zaffalon
CSDA
2008
62views more  CSDA 2008»
9 years 1 months ago
Waiting time distribution of generalized later patterns
In this paper the concept of later waiting time distributions for patterns in multi-state trials is generalized to cover a collection of compound patterns that must all be counted...
Donald E. K. Martin, John A. D. Aston
books