Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model...
Konstantin Voevodski, Maria-Florina Balcan, Heiko ...
In this paper, we address the server selection problem for streaming applications on the Internet. The architecture we consider is similar to the content distribution networks con...
We consider approaches for exact similarity search in a high dimensional space of correlated features representing image datasets, based on principles of clustering and vector qua...
In most of the proposed clustering algorithms for wireless ad hoc networks, the cluster-heads form a dominating set in the network topology. A variant of dominating set which is mo...
—Bug-free first silicon is not guaranteed by the existing pre-silicon verification techniques. To have impeccable products, it is now required to identify any bug as soon as the ...