Sciweavers

1091 search results - page 30 / 219
» Approximation Algorithms for Data Placement Problems
Sort
View
TNN
2008
181views more  TNN 2008»
13 years 7 months ago
Optimized Approximation Algorithm in Neural Networks Without Overfitting
In this paper, an optimized approximation algorithm (OAA) is proposed to address the overfitting problem in function approximation using neural networks (NNs). The optimized approx...
Yinyin Liu, Janusz A. Starzyk, Zhen Zhu
CORR
2011
Springer
168views Education» more  CORR 2011»
13 years 2 months ago
Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection
We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can ...
Abhimanyu Das, David Kempe
HPDC
2008
IEEE
14 years 2 months ago
Managing SLAs of heterogeneous workloads using dynamic application placement
In this paper we address the problem of managing heterogeneous workloads in a virtualized data center. We consider two different workloads: transactional applications and long-ru...
David Carrera, Malgorzata Steinder, Ian Whalley, J...
MOR
2007
149views more  MOR 2007»
13 years 7 months ago
LP Rounding Approximation Algorithms for Stochastic Network Design
Real-world networks often need to be designed under uncertainty, with only partial information and predictions of demand available at the outset of the design process. The field ...
Anupam Gupta, R. Ravi, Amitabh Sinha
INFOCOM
2008
IEEE
14 years 2 months ago
Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marat...