Sciweavers

500 search results - page 57 / 100
» Quantified Conditionals and Compositionality
Sort
View
PODS
2008
ACM
250views Database» more  PODS 2008»
14 years 8 months ago
Approximating predicates and expressive queries on probabilistic databases
We study complexity and approximation of queries in an expressive query language for probabilistic databases. The language studied supports the compositional use of confidence com...
Christoph Koch
ICALP
1994
Springer
13 years 12 months ago
Liveness in Timed and Untimed Systems
When provingthe correctness of algorithmsin distributed systems, one generally considers safety conditions and liveness conditions. The Input Output I O automaton model and its ti...
Rainer Gawlick, Roberto Segala, Jørgen F. S...
SIGSOFT
2008
ACM
14 years 8 months ago
Modular verification of web services using efficient symbolic encoding and summarization
We propose a novel method for modular verification of web service compositions. We first use symbolic fixpoint computations to derive conditions on the incoming messages and relat...
Fang Yu, Chao Wang, Aarti Gupta, Tevfik Bultan
RECOMB
2003
Springer
14 years 8 months ago
Haplotype reconstruction from SNP alignment
In this paper, we describe a method for statistical reconstruction of haplotypes from a set of aligned SNP fragments. We consider the case of a pair of homologous human chromosome...
Lei Li, Jong Hyun Kim, Michael S. Waterman
DSN
2005
IEEE
14 years 1 months ago
Lumping Matrix Diagram Representations of Markov Models
Continuous-time Markov chains (CTMCs) have been used successfully to model the dependability and performability of many systems. Matrix diagrams (MDs) are known to be a space-efï¬...
Salem Derisavi, Peter Kemper, William H. Sanders