Descriptive Sampling (DS), a Monte Carlo sampling technique based on a deterministic selection of the input values and their random permutation, represents a deep conceptual chang...
We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...
Concentration of measure inequalities are at the heart of much theoretical analysis of randomized compressive operators. Though commonly studied for dense matrices, in this paper ...
Michael B. Wakin, Jae Young Park, Han Lun Yap, Chr...
We present an implementation of the protocol of Lindell and Pinkas for secure two-party computation which is secure against malicious adversaries [13]. This is the first running sy...
We provide a new technique for the Euclidean upgrading of a projective calibration for a set of ten or more cameras with known skew angle and aspect ratio and arbitrary varying fo...