Sciweavers

225 search results - page 41 / 45
» Approximating Parameterized Convex Optimization Problems
Sort
View
TON
2010
141views more  TON 2010»
13 years 6 months ago
Weighted spectral distribution for internet topology analysis: theory and applications
Abstract—Comparing graphs to determine the level of underlying structural similarity between them is a widely encountered problem in computer science. It is particularly relevant...
Damien Fay, Hamed Haddadi, Andrew Thomason, Andrew...
ICPPW
2009
IEEE
14 years 3 months ago
Dynamic Control and Resource Allocation in Wireless-Infrastructured Distributed Cellular Networks with OFDMA
—In this paper, we consider joint optimization of end-to-end data transmission and resource allocation for Wireless-Infrastructured Distributed Cellular Networks (WIDCNs), where ...
Lei You, Ping Wu, Mei Song, Junde Song, Yong Zhang
JMLR
2006
124views more  JMLR 2006»
13 years 8 months ago
Policy Gradient in Continuous Time
Policy search is a method for approximately solving an optimal control problem by performing a parametric optimization search in a given class of parameterized policies. In order ...
Rémi Munos
SIAMJO
2002
92views more  SIAMJO 2002»
13 years 8 months ago
Generalized Bundle Methods
We study a class of generalized bundle methods for which the stabilizing term can be any closed convex function satisfying certain properties. This setting covers several algorithm...
Antonio Frangioni
ICML
2008
IEEE
14 years 9 months ago
Active kernel learning
Identifying the appropriate kernel function/matrix for a given dataset is essential to all kernel-based learning techniques. A variety of kernel learning algorithms have been prop...
Steven C. H. Hoi, Rong Jin