Estimation of the amounts of target molecules in realtime affinity-based biosensors is studied. The problem is mapped to inferring the parameters of a temporally sampled diffusio...
We examine classes of distributional problems defined in terms of polynomial-time decision algorithms with bounded error probability. The class AvgP [5] has been characterized in...
We show that two cooperating robots can learn exactly any strongly-connected directed graph with n indistinguishable nodes in expected time polynomial in n. We introduce a new typ...
We apply and extend the priority algorithm framework introduced by Borodin, Nielsen, and Rackoff to define "greedy-like" algorithms for the (uncapacitated) facility locat...
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...