Sciweavers

291 search results - page 30 / 59
» The Convergence of Contrastive Divergences
Sort
View
COR
2006
91views more  COR 2006»
15 years 6 months ago
An LP approach to compute the pre-kernel for cooperative games
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...
Holger Meinhardt
CVPR
2008
IEEE
16 years 8 months ago
Globally optimal bilinear programming for computer vision applications
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...
Manmohan Krishna Chandraker, David J. Kriegman
INFOCOM
2005
IEEE
15 years 11 months ago
Limiting path exploration in BGP
— 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...
Jaideep Chandrashekar, Zhenhai Duan, Zhi-Li Zhang,...
ICASSP
2011
IEEE
14 years 9 months ago
Interference alignment in MIMO cellular networks
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, ...
Binnan Zhuang, Randall A. Berry, Michael L. Honig
STOC
2010
ACM
220views Algorithms» more  STOC 2010»
15 years 10 months ago
Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
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...
Mohsen Bayati, David Gamarnik, Prasad Tetali