The paper investigates parameterized approximate message-passing schemes that are based on bounded inference and are inspired by Pearl’s belief propagation algorithm (BP). We st...
Robert Mateescu, Kalev Kask, Vibhav Gogate, Rina D...
We initiate the study of graph sketching, i.e., algorithms that use a limited number of linear measurements of a graph to determine the properties of the graph. While a graph on n...
The World Wide Web has transformed into an environment where users both produce and consume information. In order to judge the validity of information, it is important to know how...
Thomas DuBois, Jennifer Golbeck, Aravind Srinivasa...
We observe returns of a simple random walk on a finite graph to a fixed node, and would like to infer properties of the graph, in particular properties of the spectrum of the trans...
Abstract. The underground malware-based economy is flourishing and it is evident that the classical ad-hoc signature detection methods are becoming insufficient. Malware authors ...