Sciweavers

8699 search results - page 3 / 1740
» Elements of the Theory of Computation
Sort
View
TMI
2008
92views more  TMI 2008»
13 years 7 months ago
Using Perturbation Theory to Compute the Morphological Similarity of Diffusion Tensors
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...
Ravi Bansal, Lawrence H. Staib, Dongrong Xu, Andre...
CIE
2005
Springer
14 years 1 months ago
Computably Enumerable Sets in the Solovay and the Strong Weak Truth Table Degrees
The strong weak truth table reducibility was suggested by Downey, Hirschfeldt, and LaForte as a measure of relative randomness, alternative to the Solovay reducibility. It also occ...
George Barmpalias
MOC
2000
124views more  MOC 2000»
13 years 7 months ago
Local and parallel finite element algorithms based on two-grid discretizations
A number of new local and parallel discretization and adaptive finite element algorithms are proposed and analyzed in this paper for elliptic boundary value problems. These algorit...
Jinchao Xu, Aihui Zhou
INFORMATICALT
2010
134views more  INFORMATICALT 2010»
13 years 4 months ago
Observability of Turing Machines: A Refinement of the Theory of Computation
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 ...
Yaroslav D. Sergeyev, Alfredo Garro
PKC
2009
Springer
164views Cryptology» more  PKC 2009»
14 years 8 months ago
Asynchronous Multiparty Computation: Theory and Implementation
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|...
Ivan Damgård, Jesper Buus Nielsen, Martin Ge...