Sciweavers

7150 search results - page 434 / 1430
» An Approximation Algorithm for Approximation Rank
Sort
View
IPPS
2005
IEEE
16 years 14 days ago
Tight Bounds for Wavelength Assignment on Trees of Rings
: A fundamental problem in communication networks is wavelength assignment (WA): given a set of routing paths on a network, assign a wavelength to each path such that the paths wit...
Zhengbing Bian, Qian-Ping Gu, Xiao Zhou
JMLR
2010
192views more  JMLR 2010»
15 years 1 months ago
Efficient Learning of Deep Boltzmann Machines
We present a new approximate inference algorithm for Deep Boltzmann Machines (DBM's), a generative model with many layers of hidden variables. The algorithm learns a separate...
Ruslan Salakhutdinov, Hugo Larochelle
IJCNN
2000
IEEE
15 years 11 months ago
Piecewise Linear Homeomorphisms: The Scalar Case
The class of piecewise linear homeomorphisms (PLH) provides a convenient functional representation for many applications wherein an approximation to data is required that is inver...
Richard E. Groff, Daniel E. Koditschek, Pramod P. ...
IJSNET
2007
100views more  IJSNET 2007»
15 years 6 months ago
Fault tolerant topology control for one-to-all communications in symmetric wireless networks
: This paper introduces the problem of fault tolerant topology control for one-to-all communications in symmetric wireless networks. We investigate two algorithms to address the pr...
Feng Wang 0002, Kuai Xu, My T. Thai, Ding-Zhu Du
TC
2008
15 years 6 months ago
Localized Broadcasting with Guaranteed Delivery and Bounded Transmission Redundancy
The common belief is that localized broadcast algorithms are not able to guarantee both full delivery and a good bound on the number of transmissions. In this paper, we propose the...
Majid Khabbazian, Vijay K. Bhargava