Sciweavers

316 search results - page 5 / 64
» On Approximate Majority and Probabilistic Time
Sort
View
SSDBM
2005
IEEE
148views Database» more  SSDBM 2005»
14 years 1 months ago
A Fast Approximation Scheme for Probabilistic Wavelet Synopses
Several studies have demonstrated the effectiveness of Haar wavelets in reducing large amounts of data down to compact wavelet synopses that can be used to obtain fast, accurate a...
Antonios Deligiannakis, Minos N. Garofalakis, Nick...
APLAS
2007
ACM
13 years 11 months ago
Timed, Distributed, Probabilistic, Typed Processes
This paper studies types and probabilistic bisimulations for a timed -calculus as an effective tool for a compositional analysis of probabilistic distributed behaviour. The types c...
Martin Berger, Nobuko Yoshida
QEST
2008
IEEE
14 years 1 months ago
Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics
In [3] a probabilistic semantics for timed automata has been defined in order to rule out unlikely (sequences of) events. The qualitative model-checking problem for LTL propertie...
Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye...
ASM
2010
ASM
14 years 17 days ago
Formal Probabilistic Analysis: A Higher-Order Logic Based Approach
Traditionally, simulation is used to perform probabilistic analysis. However, it provides less accurate results and cannot handle large-scale problems due to the enormous CPU time ...
Osman Hasan, Sofiène Tahar
SDM
2010
SIAM
144views Data Mining» more  SDM 2010»
13 years 9 months ago
A Probabilistic Framework to Learn from Multiple Annotators with Time-Varying Accuracy
This paper addresses the challenging problem of learning from multiple annotators whose labeling accuracy (reliability) differs and varies over time. We propose a framework based ...
Pinar Donmez, Jaime G. Carbonell, Jeff Schneider