Sciweavers

16091 search results - page 296 / 3219
» Solving
Sort
View
ICASSP
2011
IEEE
14 years 10 months ago
Fast algorithm for beamforming problems in distributed communication of relay networks
A sequential quadratic programming (SQP) method is proposed to solve the distributed beamforming problem in multiple relay networks. The problem is formulated as the minimization ...
Cong Sun, Yaxiang Yuan
163
Voted
ICASSP
2011
IEEE
14 years 10 months ago
Median filter with absolute value norm spatial regularization
We provide a novel formulation for computing median filter with spatial regularization as minimizing a cost function composed of absolute value norms. We turn this cost minimizat...
Nilanjan Ray
AAAI
2011
14 years 6 months ago
Linear Dynamic Programs for Resource Management
Sustainable resource management in many domains presents large continuous stochastic optimization problems, which can often be modeled as Markov decision processes (MDPs). To solv...
Marek Petrik, Shlomo Zilberstein
EMMCVPR
2011
Springer
14 years 6 months ago
SlimCuts: GraphCuts for High Resolution Images Using Graph Reduction
Abstract. This paper proposes an algorithm for image segmentation using GraphCuts which can be used to efficiently solve labeling problems on high resolution images or resource-lim...
Björn Scheuermann, Bodo Rosenhahn
ICC
2011
IEEE
272views Communications» more  ICC 2011»
14 years 6 months ago
Dynamic Anycast Routing and Wavelength Assignment in WDM Networks Using Ant Colony Optimization (ACO)
—Ant colony optimization (ACO) is a probabilistic technique used for solving complex computational problems, such as finding optimal routes in networks. It has been proved to pe...
Kavitha Bhaskaran, Joan Triay, Vinod Vokkarane