Sciweavers

240 search results - page 41 / 48
» Incorporating Tables into Proofs
Sort
View
CCS
2008
ACM
13 years 9 months ago
Efficient attributes for anonymous credentials
We extend the Camenisch-Lysyanskaya anonymous credential system such that selective disclosure of attributes becomes highly efficient. The resulting system significantly improves ...
Jan Camenisch, Thomas Groß
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
14 years 8 months ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson
DCC
2006
IEEE
14 years 7 months ago
The B-coder: An Improved Binary Arithmetic Coder and Probability Estimator
In this paper we present the B-coder, an efficient binary arithmetic coder that performs extremely well on a wide range of data. The B-coder should be classed as an `approximate&#...
Benjamin Kelly, David F. Brailsford
FPGA
2007
ACM
163views FPGA» more  FPGA 2007»
14 years 2 months ago
Improved SAT-based Boolean matching using implicants for LUT-based FPGAs
Boolean matching (BM) is a widely used technique in FPGA resynthesis and architecture evaluation. In this paper we present several improvements to the recently proposed SAT-based ...
Jason Cong, Kirill Minkovich
VISUALIZATION
2000
IEEE
14 years 7 days ago
Isosurfacing in higher dimensions
Visualization algorithms have seen substantial improvements in the past several years. However, very few algorithms have been developed for directly studying data in dimensions hi...
Praveen Bhaniramka, Rephael Wenger, Roger Crawfis