Recent work has shown that one can learn the structure of Gaussian Graphical Models by imposing an L1 penalty on the precision matrix, and then using efficient convex optimization...
Link analysis algorithms have been extensively used in Web information retrieval. However, current link analysis algorithms generally work on a flat link graph, ignoring the hiera...
We consider the weight design problem for the consensus algorithm under a finite time horizon. We assume that the underlying network is random where the links fail at each iterat...
We conducted eye-tracking studies of subjects solving the problem of finding shortest paths in a graph using a known procedure (Dijkstra's algorithm). The goal of these studie...
Daesub Yoon, N. Hari Narayanan, SooCheol Lee, Oh-C...
In this paper, we review a recently developed class of algorithms that solve global problems in unit distance wireless networks by means of local algorithms. A local algorithm is ...