We develop a method for matching dynamic histories of program executions of two program versions. The matches produced can be useful in many applications including software piracy...
There has been considerable past work on efficiently computing top k objects by aggregating information from multiple ranked lists of these objects. An important instance of this...
Ravi Kumar, Kunal Punera, Torsten Suel, Sergei Vas...
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
We derive a probabilistic multi-scale model for contour completion based on image statistics. The boundaries of human segmented images are used as "ground truth". A prob...
We propose a framework to learn statistical shape models for faces as piecewise linear models. Specifically, our methodology builds upon primitive active shape models(ASM) to hand...