5964 search results - page 55 / 1193 » A theory of speculative computation |
131
click to vote
FLOPS
2006
Springer
15 years 8 months ago
2006
Springer
Pocklington certificates are known to provide short proofs of primality. We show how to perform this in the framework of formal, mechanically checked, proofs. We present an encodin...
154
click to vote
INFORMATICALT
2010
15 years 1 months ago
2010
The Turing machine is one of the simple abstract computational devices that can be used to investigate the limits of computability. In this paper, they are considered from several ...
126
click to vote
PKC
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. We propose an asynchronous protocol for general multiparty computation with perfect security and communication complexity O(n2 |C|k) where n is the number of parties, |C|...
143
click to vote
MM
1996
ACM
15 years 8 months ago
1996
ACM
Narrative structure models are useful tools for understanding how and why narratives of any medium affect an audience's level of participation in their role of story reconstr...
128
click to vote
TMI
2008
15 years 4 months ago
2008
Computing the morphological similarity of diffusion tensors (DTs) at neighboring voxels within a DT image, or at corresponding locations across different DT images, is a fundamenta...