: Network topology not only tells about tightly-connected “communities,” but also gives cues on more subtle properties of the vertices. We introduce a simple probabilistic late...
– Probabilistic Inference Networks are becoming increasingly popular for modeling and reasoning in uncertain domains. In the past few years, many efforts have been made in learni...
We formulate the problem of graph inference where part of the graph is known as a supervised learning problem, and propose an algorithm to solve it. The method involves the learni...
Traditional hop-by-hop dynamic routing makes inefficient use of network resources as it forwards packets along already congested shortest paths while uncongested longer paths may b...
Minsoo Lee, Xiaohui Ye, Dan Marconett, Samuel John...
Abstract. Verification by network invariants is a heuristic to solve uniform verification of parameterized systems. Given a system P, a network invariant for P is that abstracts th...