Sciweavers

1855 search results - page 3 / 371
» A coding theorem for distributed computation
Sort
View
AISC
2010
Springer
14 years 8 days ago
On Krawtchouk Transforms
Krawtchouk polynomials appear in a variety of contexts, most notably as orthogonal polynomials and in coding theory via the Krawtchouk transform. We present an operator calculus fo...
Philip Feinsilver, René Schott
PODC
1989
ACM
13 years 11 months ago
A Structural Induction Theorem for Processes
Robert P. Kurshan, Kenneth L. McMillan
SP
2002
IEEE
161views Security Privacy» more  SP 2002»
13 years 7 months ago
Improving Computer Security Using Extended Static Checking
We describe a method for finding security flaws in source code by way of static analysis. The method is notable because it allows a user to specify a wide range of security proper...
Brian Chess
AISC
1998
Springer
13 years 11 months ago
Reasoning About Coding Theory: The Benefits We Get from Computer Algebra
The use of computer algebra is usually considered beneficial for mechanised reasoning in mathematical domains. We present a case study, in the application domain of coding theory, ...
Clemens Ballarin, Lawrence C. Paulson
CIE
2009
Springer
14 years 2 months ago
Computable Exchangeable Sequences Have Computable de Finetti Measures
Abstract. We prove a uniformly computable version of de Finetti’s theorem on exchangeable sequences of real random variables. In the process, we develop machinery for computably ...
Cameron E. Freer, Daniel M. Roy