We study algorithms for clustering data that were recently proposed by Balcan, Blum and Gupta in SODA’09 [4] and that have already given rise to two follow-up papers. The input f...
We derive an easy-to-compute approximate bound for the range of step-sizes for which the constant-modulus algorithm (CMA) will remain stable if initialized close to a minimum of t...
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
In this paper, we propose a symmetrical EEG/fMRI fusion algorithm which combines EEG and fMRI by means of a common generative model. The use of a total variation (TV) prior as wel...
Martin Luessi, S. Derin Babacan, Rafael Molina, Ja...
We design algorithms for computing approximately revenue-maximizing sequential postedpricing mechanisms (SPM) in K-unit auctions, in a standard Bayesian model. A seller has K copi...