Sciweavers

197 search results - page 7 / 40
» Undecidability Results for Distributed Probabilistic Systems
Sort
View
CJ
2002
67views more  CJ 2002»
14 years 11 months ago
Using Bloom Filters to Speed-up Name Lookup in Distributed Systems
Bloom filters make use of a "probabilistic" hash-coding method to reduce the amount of space required to store a hash set. A Bloom filter offers a trade-off between its ...
Mark C. Little, Santosh K. Shrivastava, Neil A. Sp...
TACAS
2000
Springer
138views Algorithms» more  TACAS 2000»
15 years 3 months ago
Symbolic Model Checking of Probabilistic Processes Using MTBDDs and the Kronecker Representation
This paper reports on experimental results with symbolic model checking of probabilistic processes based on Multi-Terminal Binary Decision Diagrams (MTBDDs). We consider concurrent...
Luca de Alfaro, Marta Z. Kwiatkowska, Gethin Norma...
DOLAP
2006
ACM
15 years 5 months ago
Pre-aggregation with probability distributions
Motivated by the increasing need to analyze complex, uncertain multidimensional data this paper proposes probabilistic OLAP queries that are computed using probability distributio...
Igor Timko, Curtis E. Dyreson, Torben Bach Pederse...
COLT
1995
Springer
15 years 3 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
VLDB
2005
ACM
110views Database» more  VLDB 2005»
15 years 5 months ago
U-DBMS: A Database System for Managing Constantly-Evolving Data
In many systems, sensors are used to acquire information from external environments such as temperature, pressure and locations. Due to continuous changes in these values, and lim...
Reynold Cheng, Sarvjeet Singh, Sunil Prabhakar