Sciweavers

20 search results - page 4 / 4
» A random construction for permutation codes and the covering...
Sort
View
FSE
2010
Springer
146views Cryptology» more  FSE 2010»
13 years 8 months ago
A Unified Method for Improving PRF Bounds for a Class of Blockcipher Based MACs
This paper provides a unified framework for improving PRF (pseudorandom function) advantages of several popular MACs (message authentication codes) based on a blockcipher modeled a...
Mridul Nandi
ISSTA
2010
ACM
13 years 6 months ago
OCAT: object capture-based automated testing
Testing object-oriented (OO) software is critical because OO languages are commonly used in developing modern software systems. In testing OO software, one important and yet chall...
Hojun Jaygarl, Sunghun Kim, Tao Xie, Carl K. Chang
INFOCOM
1998
IEEE
13 years 9 months ago
Informed-Source Coding-on-Demand (ISCOD) over Broadcast Channels
We present the Informed-Source Coding-On-Demand (ISCOD) approach for efficiently supplying non-identical data from a central server to multiple caching clients through a broadcast ...
Yitzhak Birk, Tomer Kol
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
SIAMCOMP
1998
125views more  SIAMCOMP 1998»
13 years 4 months ago
Free Bits, PCPs, and Nonapproximability-Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
Mihir Bellare, Oded Goldreich, Madhu Sudan