Sciweavers

100 search results - page 15 / 20
» Symbolic Bisimulations for Probabilistic Systems
Sort
View
PVLDB
2008
122views more  PVLDB 2008»
13 years 7 months ago
Exploiting shared correlations in probabilistic databases
There has been a recent surge in work in probabilistic databases, propelled in large part by the huge increase in noisy data sources -from sensor data, experimental data, data fro...
Prithviraj Sen, Amol Deshpande, Lise Getoor
STAIRS
2008
169views Education» more  STAIRS 2008»
13 years 9 months ago
Probabilistic Association Rules for Item-Based Recommender Systems
Since the beginning of the 1990's, the Internet has constantly grown, proposing more and more services and sources of information. The challenge is no longer to provide users ...
Sylvain Castagnos, Armelle Brun, Anne Boyer
LICS
2009
IEEE
14 years 2 months ago
On the Computational Complexity of Verifying One-Counter Processes
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...
Stefan Göller, Richard Mayr, Anthony Widjaja ...
DAC
1994
ACM
13 years 11 months ago
Probabilistic Analysis of Large Finite State Machines
Regarding nite state machines as Markov chains facilitates the application of probabilistic methods to very large logic synthesis and formal veri cation problems. Recently, we ha...
Gary D. Hachtel, Enrico Macii, Abelardo Pardo, Fab...
ICCAD
2005
IEEE
90views Hardware» more  ICCAD 2005»
14 years 4 months ago
Scalable compositional minimization via static analysis
State-equivalence based reduction techniques, e.g. bisimulation minimization, can be used to reduce a state transition system to facilitate subsequent verification tasks. However...
Fadi A. Zaraket, Jason Baumgartner, Adnan Aziz