Sciweavers

4403 search results - page 391 / 881
» Galois Theory of Algorithms
Sort
View
CORR
2004
Springer
111views Education» more  CORR 2004»
15 years 6 months ago
Maximum-likelihood decoding of Reed-Solomon Codes is NP-hard
Maximum-likelihood decoding is one of the central algorithmic problems in coding theory. It has been known for over 25 years that maximum-likelihood decoding of general linear cod...
Venkatesan Guruswami, Alexander Vardy
MOR
2000
90views more  MOR 2000»
15 years 6 months ago
A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NP-hard in the s...
Martin Skutella, Gerhard J. Woeginger
FOCM
2002
83views more  FOCM 2002»
15 years 6 months ago
A Rigorous ODE Solver and Smale's 14th Problem
We present an algorithm for computing rigorous solutions to a large class of ordinary differential equations. The main algorithm is based on a partitioning process and the use of i...
Warwick Tucker
TCS
1998
15 years 6 months ago
ERCW PRAMs and Optical Communication
This paper presents algorithms and lower bounds for several fundamental problems on the Exclusive Read, Concurrent Write Parallel Random Access Machine (ERCW PRAM) and some result...
Philip D. MacKenzie, Vijaya Ramachandran
SIGKDD
2002
90views more  SIGKDD 2002»
15 years 6 months ago
Cryptographic Techniques for Privacy-Preserving Data Mining
Research in secure distributed computation, which was done as part of a larger body of research in the theory of cryptography, has achieved remarkable results. It was shown that n...
Benny Pinkas