Sciweavers

2430 search results - page 133 / 486
» Computing Tutte Polynomials
Sort
View
ICCS
2004
Springer
15 years 10 months ago
DisCAS: A Distributed-Parallel Computer Algebra System
The DisCAS system employs and interacts with multiple ELIMINOs distributed over the Internet to achieve a distributed-parallel computing environment. ELIMINO is a computer algebra ...
Yongwei Wu, Guangwen Yang, Weimin Zheng, Dongdai L...
CCGRID
2008
IEEE
15 years 11 months ago
Joint Communication and Computation Task Scheduling in Grids
In this paper we present a multicost algorithm for the joint time scheduling of the communication and computation resources that will be used by a task. The proposed algorithm sel...
Kostas Christodoulopoulos, Nikolaos D. Doulamis, E...
EUROCRYPT
2004
Springer
15 years 10 months ago
On the Hardness of Information-Theoretic Multiparty Computation
We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational com...
Yuval Ishai, Eyal Kushilevitz
DISCO
1993
114views Hardware» more  DISCO 1993»
15 years 9 months ago
Gauss: A Parameterized Domain of Computation System with Support for Signature Functions
The fastest known algorithms in classical algebra make use of signature functions. That is, reducing computation with formulae to computing with the integers modulo p, by substitut...
Michael B. Monagan
ICC
2007
IEEE
15 years 11 months ago
Computing Maximum-Likelihood Bounds for Reed-Solomon Codes over Partial Response Channels
Abstract—Computing maximum-likelihood bounds on the performance of systems involving partial response (PR) channels, with or without an error correcting code present, is rather c...
Richard M. Todd, J. R. Cruz