Motivated by the problem of detecting link-spam, we consider the following graph-theoretic primitive: Given a webgraph G, a vertex v in G, and a parameter δ ∈ (0, 1), compute th...
Reid Andersen, Christian Borgs, Jennifer T. Chayes...
We propose a new fault localization technique for software bugs in large-scale computing systems. Our technique always collects per-process function call traces of a target system...
Abstract A divide-and-conquer algorithm for computing the parametric yield of large analog circuits is presented. The algorithm targets applications whose performance spreads could...
Reservoir Computing (RC) techniques use a fixed (usually randomly created) recurrent neural network, or more generally any dynamic system, which operates at the edge of stability,...
Eric A. Antonelo, Benjamin Schrauwen, Dirk Strooba...
We describe computation migration,a new technique that is based on compile-time program transformations, for accessing remote data in a distributed-memory parallel system. In cont...