Sciweavers

3049 search results - page 79 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
ICML
2003
IEEE
16 years 5 months ago
Optimization with EM and Expectation-Conjugate-Gradient
We show a close relationship between the Expectation - Maximization (EM) algorithm and direct optimization algorithms such as gradientbased methods for parameter learning. We iden...
Ruslan Salakhutdinov, Sam T. Roweis, Zoubin Ghahra...
ISPD
2003
ACM
121views Hardware» more  ISPD 2003»
15 years 9 months ago
Optimality, scalability and stability study of partitioning and placement algorithms
This paper studies the optimality, scalability and stability of stateof-the-art partitioning and placement algorithms. We present algorithms to construct two classes of benchmarks...
Jason Cong, Michail Romesis, Min Xie
CORR
2010
Springer
104views Education» more  CORR 2010»
15 years 4 months ago
An Optimal Lower Bound for Buffer Management in Multi-Queue Switches
In the online packet buffering problem (also known as the unweighted FIFO variant of buffer management), we focus on a single network packet switching device with several input po...
Marcin Bienkowski
SIGECOM
2011
ACM
232views ECommerce» more  SIGECOM 2011»
14 years 7 months ago
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...
IPPS
1998
IEEE
15 years 8 months ago
Lower Bounds on Communication Loads and Optimal Placements in Torus Networks
Fully-populated tori, where every node has a processor attached, do not scale well since load on edges increases superlinearly with network size under heavy communication, resulti...
M. Cemil Azizoglu, Ömer Egecioglu