Sciweavers

62 search results - page 5 / 13
» Optimal BSR Solutions to Several Convex Polygon Problems
Sort
View
CVPR
2010
IEEE
14 years 3 months ago
Efficient Piecewise Learning for Conditional Random Fields
Conditional Random Field models have proved effective for several low-level computer vision problems. Inference in these models involves solving a combinatorial optimization probl...
Karteek Alahari, Phil Torr
CORR
2008
Springer
127views Education» more  CORR 2008»
13 years 7 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
CDC
2010
IEEE
215views Control Systems» more  CDC 2010»
13 years 2 months ago
Consensus with robustness to outliers via distributed optimization
Over the past few years, a number of distributed algorithms have been developed for integrating the measurements acquired by a wireless sensor network. Among them, average consensu...
Jixin Li, Ehsan Elhamifar, I.-Jeng Wang, Ren&eacut...
ICC
2007
IEEE
119views Communications» more  ICC 2007»
14 years 1 months ago
A Convex Quadratic SDMA Grouping Algorithm Based on Spatial Correlation
Abstract— Space Division Multiple Access (SDMA) is a promising solution to improve the spectral efficiency of future mobile radio systems. However, finding the group of MSs tha...
Tarcisio F. Maciel, Anja Klein
TSMC
2002
119views more  TSMC 2002»
13 years 7 months ago
Approximation of n-dimensional data using spherical and ellipsoidal primitives
This paper discusses the problem of approximating data points in -dimensional Euclidean space using spherical and ellipsoidal surfaces. A closed form solution is provided for spher...
Giuseppe Carlo Calafiore