Cluster Editing is transforming a graph by at most k edge insertions or deletions into a disjoint union of cliques. This problem is fixed-parameter tractable (FPT). Here we comput...
In this work we study the problem of Bipartite Correlation Clustering (BCC), a natural bipartite counterpart of the well studied Correlation Clustering (CC) problem. Given a bipart...
Nir Ailon, Noa Avigdor-Elgrabli, Edo Liberty, Anke...
In this paper, a new learning framework?probabilistic boosting-tree (PBT), is proposed for learning two-class and multi-class discriminative models. In the learning stage, the pro...
We introduce and evaluate a middleware clustering technology capable of allocating resources to web applications through dynamic application instance placement. We define applicat...
A. Karve, Tracy Kimbrel, Giovanni Pacifici, Mike S...
—Millions of surveillance cameras record video around the clock, producing huge video archives. Even when a video archive is known to include critical activities, finding them i...