We present an algorithm to compute the (pre)-kernel of a TU-game N, v with a system of n 2 1 linear programming problems. In contrast to the algorithms using convergence methods t...
We present a practical algorithm that provably achieves the global optimum for a class of bilinear programs commonly arising in computer vision applications. Our approach relies o...
— Slow convergence in the Internet can be directly attributed to the “path exploration” phenomenon, inherent in all path vector protocols. The root cause for path exploration...
We explore the feasibility of linear interference alignment (IA) in MIMO cellular networks. Each base station (BTS) has Nt transmit antennas, each mobile has Nr receive antennas, ...
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...