Sciweavers

488 search results - page 28 / 98
» Compositional Verification of Probabilistic Systems Using Le...
Sort
View
COLT
1995
Springer
15 years 2 months ago
On the Learnability and Usage of Acyclic Probabilistic Finite Automata
We propose and analyze a distribution learning algorithm for a subclass of Acyclic Probabilistic Finite Automata (APFA). This subclass is characterized by a certain distinguishabi...
Dana Ron, Yoram Singer, Naftali Tishby
CCS
2006
ACM
15 years 2 months ago
Secure information flow with random assignment and encryption
Type systems for secure information flow aim to prevent a program from leaking information from variables classified as H to variables classified as L. In this work we extend such...
Geoffrey Smith
IAJIT
2010
96views more  IAJIT 2010»
14 years 9 months ago
A Data Mashup for Dynamic Composition of Adaptive Courses
: This paper presents a novel adaptive course composition system that based on mashing up learning content in a web application. The system includes three major components, static ...
Mohammed Al-Zoube, Baha Khasawneh
FLAIRS
2008
15 years 1 months ago
Learning a Probabilistic Model of Event Sequences from Internet Weblog Stories
One of the central problems in building broad-coverage story understanding systems is generating expectations about event sequences, i.e. predicting what happens next given some a...
Mehdi Manshadi, Reid Swanson, Andrew S. Gordon
ICDE
2006
IEEE
193views Database» more  ICDE 2006»
16 years 13 days ago
Probabilistic Message Passing in Peer Data Management Systems
Until recently, most data integration techniques involved central components, e.g., global schemas, to enable transparent access to heterogeneous databases. Today, however, with t...
Philippe Cudré-Mauroux, Karl Aberer, Andras...