Sciweavers

45 search results - page 6 / 9
» focs 1998
Sort
View
FOCS
1998
IEEE
15 years 2 months ago
Towards an Optimal Bit-Reversal Permutation Program
The speed of many computations is limited not by the number of arithmetic operations but by the time it takes to move and rearrange data in the increasingly complicated memory hie...
Larry Carter, Kang Su Gatlin
FOCS
1998
IEEE
15 years 2 months ago
The Quantum Communication Complexity of Sampling
Sampling is an important primitive in probabilistic and quantum algorithms. In the spirit of communication complexity, given a function f : X
Andris Ambainis, Leonard J. Schulman, Amnon Ta-Shm...
FOCS
1998
IEEE
15 years 2 months ago
Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
This paper considers the problem of designing fast, approximate, combinatorial algorithms for multicommodity flows and other fractional packing problems. We provide a different ap...
Naveen Garg, Jochen Könemann
FOCS
1998
IEEE
15 years 1 months ago
A Tight Characterization of NP with 3 Query PCPs
It is known that there exists a PCP characterization of NP where the verifier makes 3 queries and has a onesided error that is bounded away from 1; and also that 2 queries do not ...
Venkatesan Guruswami, Daniel Lewin, Madhu Sudan, L...
FOCS
1998
IEEE
15 years 1 months ago
Recommendation Systems: A Probabilistic Analysis
A recommendation system tracks past actions of a group of users to make recommendations toindividualmembersofthe group. The growth ofcomputer-mediatedmarketingandcommerce has led ...
Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopala...