— We study the problem of optimal estimation using quantized innovations, with application to distributed estimation over sensor networks. We show that the state probability dens...
We give polynomial time computable extractors for low-weight affince sources. A distribution is affine if it samples a random points from some unknown low dimensional subspace of ...
Non-interactive zero-knowledge proofs play an essential role in many cryptographic protocols. We suggest several NIZK proof systems based on prime order groups with a bilinear map...
Probabilistic top-k ranking queries have been extensively studied due to the fact that data obtained can be uncertain in many real applications. A probabilistic top-k ranking quer...
The C source code associated with the Simulation 101 preconference workshop (offered at the 2006 and 2007 Winter Simulation Conferences) is presented here. This paper begins with ...