Sciweavers

100 search results - page 13 / 20
» Symbolic Bisimulations for Probabilistic Systems
Sort
View
ICDAR
2007
IEEE
14 years 1 months ago
Hybrid Mathematical Symbol Recognition Using Support Vector Machines
Recognition of mathematical symbols is a challenging task, with a large set with many similar symbols. We present a support vector machine based hybrid recognition system that use...
Birendra Keshari, Stephen M. Watt
ACL
2009
13 years 5 months ago
Parsing Speech Repair without Specialized Grammar Symbols
This paper describes a parsing model for speech with repairs that makes a clear separation between linguistically meaningful symbols in the grammar and operations specific to spee...
Tim Miller, Luan Nguyen, William Schuler
ATVA
2005
Springer
131views Hardware» more  ATVA 2005»
14 years 1 months ago
An MTBDD-Based Implementation of Forward Reachability for Probabilistic Timed Automata
Multi-Terminal Binary Decision Diagrams (MTBDDs) have been successfully applied in symbolic model checking of probabilistic systems. In this paper we propose an encoding method for...
Fuzhi Wang, Marta Z. Kwiatkowska
IFM
2010
Springer
152views Formal Methods» more  IFM 2010»
13 years 6 months ago
Satisfaction Meets Expectations - Computing Expected Values of Probabilistic Hybrid Systems with SMT
Stochastic satisfiability modulo theories (SSMT), which is an extension of satisfiability modulo theories with randomized quantification, has successfully been used as a symboli...
Martin Fränzle, Tino Teige, Andreas Eggers
ECAI
2008
Springer
13 years 9 months ago
Probabilistic Reinforcement Rules for Item-Based Recommender Systems
The Internet is constantly growing, proposing more and more services and sources of information. Modeling personal preferences enables recommender systems to identify relevant subs...
Sylvain Castagnos, Armelle Brun, Anne Boyer