This paper derives a near optimal distributed Kalman filter to estimate a large-scale random field monitored by a network of N sensors. The field is described by a sparsely con...
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a ...
—Distributed systems without trusted identities are particularly vulnerable to sybil attacks, where an adversary creates multiple bogus identities to compromise the running of th...
Abstract. Markov and Conditional random fields (CRFs) used in computer vision typically model only local interactions between variables, as this is computationally tractable. In t...
Graphs are canonical examples of high-dimensional non-Euclidean data sets, and are emerging as a common data structure in many fields. While there are many algorithms to analyze ...
Benjamin A. Miller, Nadya T. Bliss, Patrick J. Wol...