Abstract. Extensions of the randomized tournaments techniques introduced in [6, 7] to approximate solutions of 1-median and diameter computation of finite subsets of general metri...
In this paper, we address the issue of learning nonlinearly separable concepts with a kernel classifier in the situation where the data at hand are altered by a uniform classific...
To accelerate the training of kernel machines, we propose to map the input data to a randomized low-dimensional feature space and then apply existing fast linear methods. The feat...
We describe a new randomized data structure, the sparse partition, for solving the dynamic closest-pair problem. Using this data structure the closest pair of a set of n points in ...
Mordecai J. Golin, Rajeev Raman, Christian Schwarz...
In this paper we propose and analyze a Stochastic-Collocation method to solve elliptic Partial Differential Equations with random coefficients and forcing terms (input data of the...