Sciweavers

2446 search results - page 243 / 490
» Choiceless Polynomial Time
Sort
View
TCC
2007
Springer
102views Cryptology» more  TCC 2007»
14 years 2 months ago
Parallel Repetition of Computationally Sound Protocols Revisited
Abstract. Parallel repetition is well known to reduce the error probability at an exponential rate for single- and multi-prover interactive proofs. Bellare, Impagliazzo and Naor (1...
Krzysztof Pietrzak, Douglas Wikström
FOCS
2006
IEEE
14 years 2 months ago
On the Compressibility of NP Instances and Cryptographic Applications
We study compression that preserves the solution to an instance of a problem rather than preserving the instance itself. Our focus is on the compressibility of NP decision problem...
Danny Harnik, Moni Naor
ICMCS
2006
IEEE
159views Multimedia» more  ICMCS 2006»
14 years 2 months ago
Image Vector Quantization Indices Recovery using Lagrange Interpolation
Vector quantization (VQ) is an efficient coding algorithm due to its fast decoding efficiency. Indices of VQ will be lost during the transmission because of the signal interferenc...
Yung-Gi Wu, Chia-Hao Wu
VISUALIZATION
2005
IEEE
14 years 1 months ago
Rendering Tetrahedral Meshes with Higher-Order Attenuation Functions for Digital Radiograph Reconstruction
This paper presents a novel method for computing simulated x-ray images, or DRRs (digitally reconstructed radiographs), of tetrahedral meshes with higher-order attenuation functio...
Ofri Sadowsky, Jonathan D. Cohen, Russell H. Taylo...
WG
2005
Springer
14 years 1 months ago
Hypertree Decompositions: Structure, Algorithms, and Applications
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...
Georg Gottlob, Martin Grohe, Nysret Musliu, Marko ...