We study the approximability and inapproximability of finding identifying codes and locating-dominating codes of the minimum size. In general graphs, we show that it is possible ...
Efficiently and accurately searching for similarities among time series and discovering interesting patterns is an important and non-trivial problem. In this paper, we introduce a...
We investigate the problem of learning a widely-used latent-variable model – the Latent Dirichlet Allocation (LDA) or “topic” model – using distributed computation, where ...
David Newman, Arthur Asuncion, Padhraic Smyth, Max...
In this paper we present new local search algorithms for the Probabilistic Traveling Salesman Problem (PTSP) using sampling and ad-hoc approximation. These algorithms improve both...
Dennis Weyland, Leonora Bianchi, Luca Maria Gambar...
Estimation based on received signal strength (RSS) is crucial in sensor networks for sensor localization, target tracking, etc. In this paper, we present a Gaussian approximation ...
Volkan Cevher, Aswin C. Sankaranarayanan, Rama Che...