Sciweavers

654 search results - page 46 / 131
» An efficient approximation algorithm for the survivable netw...
Sort
View
CORR
2008
Springer
127views Education» more  CORR 2008»
13 years 9 months ago
MAPEL: Achieving Global Optimality for a Non-convex Wireless Power Control Problem
Achieving weighted throughput maximization (WTM) through power control has been a long standing open problem in interference-limited wireless networks. The complicated coupling bet...
Liping Qian, Ying Jun Zhang, Jianwei Huang
CIAC
2010
Springer
232views Algorithms» more  CIAC 2010»
14 years 5 days ago
Multicut Algorithms via Tree Decompositions
Various forms of multicut problems are of great importance in the area of network design. In general, these problems are intractable. However, several parameters have been identifi...
Reinhard Pichler, Stefan Rümmele, Stefan Woltran
CVPR
2010
IEEE
12 years 6 months ago
Abrupt motion tracking via adaptive stochastic approximation Monte Carlo sampling
Robust tracking of abrupt motion is a challenging task in computer vision due to the large motion uncertainty. In this paper, we propose a stochastic approximation Monte Carlo (...
Xiuzhuang Zhou and Yao Lu
STOC
2004
ACM
61views Algorithms» more  STOC 2004»
14 years 9 months ago
The zero-one principle for switching networks
Recently, approximation analysis has been extensively used to study algorithms for routing weighted packets in various network settings. Although different techniques were applied...
Yossi Azar, Yossi Richter
JAIR
2006
143views more  JAIR 2006»
13 years 8 months ago
Convexity Arguments for Efficient Minimization of the Bethe and Kikuchi Free Energies
Loopy and generalized belief propagation are popular algorithms for approximate inference in Markov random fields and Bayesian networks. Fixed points of these algorithms have been...
Tom Heskes