Sciweavers

2124 search results - page 174 / 425
» An Efficient Framework for Order Optimization
Sort
View
TIT
2008
84views more  TIT 2008»
15 years 6 months ago
Optimal Universal Schedules for Discrete Broadcast
In this paper we study the scenario in which a server sends dynamic data over a single broadcast channel to a number of passive clients. We consider the data to consist of discret...
Michael Langberg, Alexander Sprintson, Jehoshua Br...
JMLR
2006
175views more  JMLR 2006»
15 years 6 months ago
Learning Sparse Representations by Non-Negative Matrix Factorization and Sequential Cone Programming
We exploit the biconvex nature of the Euclidean non-negative matrix factorization (NMF) optimization problem to derive optimization schemes based on sequential quadratic and secon...
Matthias Heiler, Christoph Schnörr
ICASSP
2011
IEEE
14 years 10 months ago
Feature selection through gravitational search algorithm
In this paper we deal with the problem of feature selection by introducing a new approach based on Gravitational Search Algorithm (GSA). The proposed algorithm combines the optimi...
João Paulo Papa, Andre Pagnin, Silvana Arti...
GLOBECOM
2007
IEEE
15 years 10 months ago
Bursty Traffic in Energy-Constrained Opportunistic Spectrum Access
We design opportunistic spectrum access strategies for improving spectrum efficiency. In each slot, a secondary user chooses a subset of channels to sense and decides whether to ac...
Yunxia Chen, Qing Zhao, Ananthram Swami
CEC
2007
IEEE
16 years 26 days ago
Target shape design optimization by evolving splines
Abstract— Target shape design optimization problem (TSDOP) is a miniature model for real world design optimization problems. It is proposed as a test bed to design and analyze op...
Pan Zhang, Xin Yao, Lei Jia, Bernhard Sendhoff, Th...