6045 search results - page 173 / 1209 » Computable Linearizations of Well-partial-orderings |
EUROCRYPT
2004
Springer
14 years 1 months ago
2004
Springer
We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational com...
ASPLOS
2009
ACM
14 years 8 months ago
2009
ACM
In this paper we describe a GPU parallelization of the 3D finite difference computation using CUDA. Data access redundancy is used as the metric to determine the optimal implement...
PDP
2010
IEEE
14 years 3 months ago
2010
IEEE
—Two strategies of distribution of computations can be used to implement parallel solvers for dense linear algebra problems for Heterogeneous Computational Clusters of Multicore ...
CDC
2008
IEEE
14 years 2 months ago
2008
IEEE
— One of the important and efficient tools in system analysis is the analysis of responses to harmonic excitations. For linear systems the information on such responses is conta...
MFCS
2007
Springer
14 years 2 months ago
2007
Springer
We resolve the computational complexity of determining the treelength of a graph, thereby solving an open problem of Dourisboure and Gavoille, who introduced this parameter, and a...