Sciweavers

1146 search results - page 103 / 230
» Finite cupping sets
Sort
View
CSFW
2010
IEEE
14 years 1 months ago
Automating Open Bisimulation Checking for the Spi Calculus
We consider the problem of automating open bisimulation checking for the spi-calculus, an extension of the pi-calculus with cryptographic primitives. The notion of open bisimulatio...
Alwen Tiu, Jeremy E. Dawson
BIRTHDAY
2010
Springer
13 years 11 months ago
Choiceless Computation and Symmetry
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
Benjamin Rossman
AMC
2006
104views more  AMC 2006»
13 years 10 months ago
Three counterexamples refuting Kieu's plan for "quantum adiabatic hypercomputation"; and some uncomputable quantum mechanical ta
-- Tien D. Kieu, in 10 papers posted to the quant-ph section of the xxx.lanl.gov preprint archive [some of which were also published in printed journals such as Proc. Royal Soc. A ...
Warren D. Smith
BIRTHDAY
2010
Springer
13 years 7 months ago
Database Theory, Yuri, and Me
Yuri Gurevich made many varied and deep contributions to logic for computer science. Logic provides also the theoretical foundation of database systems. Hence, it is almost unavoid...
Jan Van den Bussche
IDA
2007
Springer
14 years 4 months ago
Compact and Understandable Descriptions of Mixtures of Bernoulli Distributions
Abstract. Finite mixture models can be used in estimating complex, unknown probability distributions and also in clustering data. The parameters of the models form a complex repres...
Jaakko Hollmén, Jarkko Tikka