Sciweavers

1021 search results - page 1 / 205
» Fast Approximate PCPs
Sort
View
RANDOM
1999
Springer
13 years 9 months ago
Fast Approximate PCPs for Multidimensional Bin-Packing Problems
Abstract. We consider approximate PCPs for multidimensional bin-packing problems. In particular, we show how a verifier can be quickly convinced that a set of multidimensional blo...
Tugkan Batu, Ronitt Rubinfeld, Patrick White
STOC
1999
ACM
104views Algorithms» more  STOC 1999»
13 years 9 months ago
Fast Approximate PCPs
We investigate the question of when a prover can aid a verifier to reliably compute a function faster than if the verifier were to compute the function on its own. Our focus is ...
Funda Ergün, Ravi Kumar, Ronitt Rubinfeld
VIS
2008
IEEE
174views Visualization» more  VIS 2008»
14 years 6 months ago
Extensions of Parallel Coordinates for Interactive Exploration of Large Multi-Timepoint Data Sets
Parallel coordinate plots (PCPs) are commonly used in information visualization to provide insight into multi-variate data. These plots help to spot correlations between variables....
Jorik Blaas, Charl P. Botha, Frits H. Post
FOCS
1995
IEEE
13 years 8 months ago
Free Bits, PCPs and Non-Approximability - Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
Mihir Bellare, Oded Goldreich, Madhu Sudan
CORR
2010
Springer
72views Education» more  CORR 2010»
13 years 5 months ago
Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes)
Prahladh Harsha, Moses Charikar, Matthew Andrews, ...