— In the last decade, graph-cut optimization has been popular for a variety of labeling problems. Typically graph-cut methods are used to incorporate smoothness constraints on a ...
This paper deals with estimation of dense optical flow
and ego-motion in a generalized imaging system by exploiting
probabilistic linear subspace constraints on the flow.
We dea...
Richard Roberts (Georgia Institute of Technology),...
The performance of graph based clustering methods critically depends on the quality of the distance function, used to compute similarities between pairs of neighboring nodes. In t...
Financial companies, engineering firms and even scientists create increasingly larger spreadsheets and spreadsheet programs. The creators of large spreadsheets make errors and mus...
Tudor Antoniu, Paul A. Steckler, Shriram Krishnamu...
Social networks are popular platforms for interaction, communication and collaboration between friends. Researchers have recently proposed an emerging class of applications that l...
Christo Wilson, Bryce Boe, Alessandra Sala, Krishn...