This paper defines and discusses a new problem in the area of subspace clustering. It defines the problem of mining closed subspace clusters. This new concept allows for the culli...
We give a new model of learning motivated by smoothed analysis (Spielman and Teng, 2001). In this model, we analyze two new algorithms, for PAC-learning DNFs and agnostically learn...
Adam Tauman Kalai, Alex Samorodnitsky, Shang-Hua T...
— This paper investigates measures of centrality that are applicable to power grids. Centrality measures are used in network science to rank the relative importance of nodes and ...
This work explores the intersection between infographics and games by examining how to embed meaningful visual analytic interactions into game mechanics that in turn impact user b...
Nicholas Diakopoulos, Funda Kivran-Swaine, Mor Naa...
In this paper, we aim to reconstruct free-form 3D models from only one or few silhouettes by learning the prior knowledge of a specific class of objects. Instead of heuristically...