We propose a generic method for obtaining quickly good upper bounds on the minimal value of a multistage stochastic program. The method is based on the simulation of a feasible dec...
— We propose a new approach to the problem of schema matching in relational databases that merges the hybrid and composite approach of combining multiple individual matching tech...
The need for communication privacy over public networks is of growing concern in today’s society. As a result, privacy-preserving authentication and key exchange protocols have ...
Giuseppe Ateniese, Jonathan Kirsch, Marina Blanton
We describe a technique for comparing distributions without the need for density estimation as an intermediate step. Our approach relies on mapping the distributions into a reprodu...
Alexander J. Smola, Arthur Gretton, Le Song, Bernh...
We consider the problem of large-scale retrieval evaluation, and we propose a statistical method for evaluating retrieval systems using incomplete judgments. Unlike existing techn...