Within-network regression addresses the task of regression in partially labeled networked data where labels are sparse and continuous. Data for inference consist of entities associ...
The bandwidth of a graph G on n vertices is the minimum b such that the vertices of G can be labeled from 1 to n such that the labels of every pair of adjacent vertices differ by ...
Let be the following strategy to construct a walk in a labeled digraph: at each vertex, we follow the unvisited arc of minimum label. In this work we study for which languages, app...
Graph-cuts based algorithms are effective for a variety
of segmentation tasks in computer vision. Ongoing research
is focused toward making the algorithms even more general,
as ...
Landmark labeling of training images is essential for many learning tasks in computer vision, such as object detection, tracking, and alignment. Image labeling is typically conduc...
Yan Tong, Xiaoming Liu 0002, Frederick W. Wheeler,...