We consider H¨older smoothness classes of surfaces for which we construct piecewise polynomial approximation networks, which are graphs with polynomial pieces as nodes and edges ...
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...
— Lithographic variability and its impact on printability is a major concern in today’s semiconductor manufacturing process. To address sub-wavelength printability, a number of...
— This paper analyzes the asymptotic behavior of packet-train probing over a multi-hop network path P carrying arbitrarily routed bursty cross-traffic flows. We examine the sta...
Xiliang Liu, Kaliappa Nadar Ravindran, Dmitri Logu...
We generalize Shimizu et al's (2006) ICA-based approach for discovering linear non-Gaussian acyclic (LiNGAM) Structural Equation Models (SEMs) from causally sufficient, conti...
Gustavo Lacerda, Peter Spirtes, Joseph Ramsey, Pat...