Sciweavers

3495 search results - page 478 / 699
» On the random satisfiable process
Sort
View
PDP
2007
IEEE
16 years 24 days ago
Parallel-External Computation of the Cycle Structure of Invertible Cryptographic Functions
We present an algorithm to compute the cycle structure of large directed graphs where each node has exactly one outgoing edge. Such graphs appear as state diagrams of finite stat...
Andreas Beckmann, Jorg Keller
QEST
2007
IEEE
16 years 24 days ago
Symbolic Bisimulations for Probabilistic Systems
The paper introduces symbolic bisimulations for a simple probabilistic π-calculus to overcome the infinite branching problem that still exists in checking ground bisimulations b...
Peng Wu 0002, Catuscia Palamidessi, Huimin Lin
CPM
2007
Springer
222views Combinatorics» more  CPM 2007»
16 years 21 days ago
Computing Exact p-Value for Structured Motif
Extracting motifs from a set of DNA sequences is important in computational biology. Occurrence probability is a common used statistics to evaluate the statistical significance of...
Jing Zhang, Xi Chen, Ming Li
DAWAK
2007
Springer
16 years 21 days ago
Computing Join Aggregates over Private Tables
We propose a privacy-preserving protocol for computing aggregation queries over the join of private tables. In this problem, several parties wish to share aggregated information ov...
Rong She, Ke Wang, Ada Wai-Chee Fu, Yabo Xu
IFL
2007
Springer
162views Formal Methods» more  IFL 2007»
16 years 21 days ago
Testing Erlang Refactorings with QuickCheck
Abstract. Refactoring is a technique for improving the design of existing programs without changing their behaviour. Wrangler is a tool built at the University of Kent to support E...
Huiqing Li, Simon Thompson