Sciweavers

29 search results - page 3 / 6
» On probabilistic fixpoint and Markov chain query languages
Sort
View
AIPS
1996
13 years 6 months ago
Event-Based Decompositions for Reasoning about External Change in Planners
An increasing number of planners can handle uncertainty in the domain or in action outcomes. However, less work has addressed building plans when the planner's world can chan...
Jim Blythe
APLAS
2007
ACM
13 years 9 months ago
A Systematic Approach to Probabilistic Pointer Analysis
Abstract. We present a formal framework for syntax directed probabilistic program analysis. Our focus is on probabilistic pointer analysis. We show how to obtain probabilistic poin...
Alessandra Di Pierro, Chris Hankin, Herbert Wiklic...
CSFW
2003
IEEE
13 years 10 months ago
Probabilistic Noninterference through Weak Probabilistic Bisimulation
To be practical, systems for ensuring secure information flow must be as permissive as possible. To this end, the author recently proposed a type system for multi-threaded progra...
Geoffrey Smith
ICGI
2004
Springer
13 years 10 months ago
Navigation Pattern Discovery Using Grammatical Inference
We present a method for modeling user navigation on a web site using grammatical inference of stochastic regular grammars. With this method we achieve better models than the previo...
Nikolaos Karampatziakis, Georgios Paliouras, Dimit...
CIKM
2008
Springer
13 years 7 months ago
A latent variable model for query expansion using the hidden markov model
We propose a novel probabilistic method based on the Hidden Markov Model (HMM) to learn the structure of a Latent Variable Model (LVM) for query language modeling. In the proposed...
Qiang Huang, Dawei Song