We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
An increasingly large number of users connect to virtual worlds on a regular basis to conduct activities ranging from gaming to business meetings. In all these worlds, users proje...
Nicolas Ducheneaut, Ming-Hui Wen, Nicholas Yee, Gr...
Algorithms based on simulating stochastic flows are a simple and natural solution for the problem of clustering graphs, but their widespread use has been hampered by their lack of...
Abstract--"Secure Device Pairing" is the process of bootstrapping a secure channel between two previously unassociated devices over a (usually wireless) human-imperceptib...
Arun Kumar, Nitesh Saxena, Gene Tsudik, Ersin Uzun
Unsupervised clustering can be significantly improved using supervision in the form of pairwise constraints, i.e., pairs of instances labeled as belonging to same or different clu...