96 search results - page 11 / 20 » Convex and Network Flow Optimization for Structured Sparsity |
WIOPT
2011
IEEE
12 years 11 months ago
2011
IEEE
Abstract—In recent years there has been an increasing awareness that the deployment as well as utilization of new information technology may have some negative ecological impact....
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Many statistical M-estimators are based on convex optimization problems formed by the weighted sum of a loss function with a norm-based regularizer. We analyze the convergence rat...
BIOINFORMATICS
2011
13 years 2 months ago
2011
Motivation: Analysis and intervention in the dynamics of gene regulatory networks is at the heart of emerging efforts in the development of modern treatment of numerous ailments i...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
A problem of joint optimal bandwidth and power allocation in cognitive networks under fading channels is considered. It is assumed that multiple secondary users (SUs) share the sp...