Suppose we have a directed graph G with set of nodes V = {1, . . . , N} and a measure xi for every node i V . The average consensus problem consists in computing the average xA = ...
We present the IteratedTverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S Rd with running time subexponential in d. The alg...
— The peer-to-peer network for sharing information and data through direct exchange has emerged rapidly in recent years. The searching problem is a basic issue that addresses the...
Current logic synthesis techniques are ineffective for arithmetic circuits. They perform poorly for XOR-dominated circuits, and those with a high fan-in dependency between inputs ...
—Identification of nodes relevant to a given node in a relational network is a basic problem in network analysis with great practical importance. Most existing network analysis ...