Sciweavers

3874 search results - page 443 / 775
» Approximation Algorithms for k-hurdle Problems
Sort
View
JSAC
2006
79views more  JSAC 2006»
15 years 6 months ago
Layered Multicast Rate Control Based on Lagrangian Relaxation and Dynamic Programming
In this paper, we address the rate control problem for layered multicast traffic, with the objective of solving a generalized throughput/fairness objective. Our approach is based o...
Koushik Kar, Leandros Tassiulas
ICASSP
2011
IEEE
14 years 10 months ago
Computing the nonnegative 3-way tensor factorization using Tikhonov regularization
This paper deals with the minimum polyadic decomposition of a nonnegative three-way array. The main advantage of the nonnegativity constraint is that the approximation problem bec...
Jean-Philip Royer, Pierre Comon, Nadège Thi...
IJCV
2012
13 years 9 months ago
Minimizing Energies with Hierarchical Costs
Abstract Computer vision is full of problems elegantly expressed in terms of energy minimization. We characterize a class of energies with hierarchical costs and propose a novel hi...
Andrew Delong, Lena Gorelick, Olga Veksler, Yuri B...
ICC
2007
IEEE
217views Communications» more  ICC 2007»
16 years 29 days ago
Decentralized Activation in a ZigBee-enabled Unattended Ground Sensor Network: A Correlated Equilibrium Game Theoretic Analysis
Abstract— We describe a decentralized learning-based activation algorithm for a ZigBee-enabled unattended ground sensor network. Sensor nodes learn to monitor their environment i...
Michael Maskery, Vikram Krishnamurthy
ISSAC
2005
Springer
119views Mathematics» more  ISSAC 2005»
16 years 4 days ago
Computing the multiplicity structure in solving polynomial systems
This paper presents a duality analysis and an algorithm for computing the multiplicity structure of a zero to a polynomial system, while the zero can be exact or approximate with ...
Barry H. Dayton, Zhonggang Zeng