We analyze the problem of packing squares in an online fashion: Given an semi-infinite strip of width 1 and an unknown sequence of squares with side lengths in [0, 1] that arrive...
Finding linear correlations in dataset is an important data mining task, which can be widely applied in the real world. Existing correlation clustering methods combine clustering w...
Liang Tang, Changjie Tang, Lei Duan, Yexi Jiang, J...
Given an undirected graph and 0 ≤ ≤ 1, a set of nodes is called -near clique if all but an fraction of the pairs of nodes in the set have a link between them. In this paper we...
The World Wide Web has transformed into an environment where users both produce and consume information. In order to judge the validity of information, it is important to know how...
Thomas DuBois, Jennifer Golbeck, Aravind Srinivasa...
We present a new approach for automatic verification of data-dependent programs manipulating dynamic heaps. A heap is encoded by a graph where the nodes represent the cells, and t...
Parosh Aziz Abdulla, Muhsin Atto, Jonathan Cederbe...