Sciweavers

3096 search results - page 76 / 620
» The Generalized FITC Approximation
Sort
View
ISAAC
2000
Springer
135views Algorithms» more  ISAAC 2000»
14 years 10 days ago
On Approximating Minimum Vertex Cover for Graphs with Perfect Matching
It has been a challenging open problem whether there is a polynomial time approximation algorithm for the Vertex Cover problem whose approximation ratio is bounded by a constant l...
Jianer Chen, Iyad A. Kanj
NIPS
2008
13 years 10 months ago
An interior-point stochastic approximation method and an L1-regularized delta rule
The stochastic approximation method is behind the solution to many important, actively-studied problems in machine learning. Despite its farreaching application, there is almost n...
Peter Carbonetto, Mark Schmidt, Nando de Freitas
JMLR
2010
132views more  JMLR 2010»
13 years 3 months ago
On the Impact of Kernel Approximation on Learning Accuracy
Kernel approximation is commonly used to scale kernel-based algorithms to applications containing as many as several million instances. This paper analyzes the effect of such appr...
Corinna Cortes, Mehryar Mohri, Ameet Talwalkar
WASA
2009
Springer
165views Algorithms» more  WASA 2009»
14 years 3 months ago
Maximum Independent Set of Links under Physical Interference Model
This paper addresses the following optimization problem in a plane multihop wireless networks under the physical interference model: From a given a set of communication links whose...
Peng-Jun Wan, Xiaohua Jia, F. Frances Yao
INFOCOM
2010
IEEE
13 years 7 months ago
Routing for Energy Minimization in the Speed Scaling Model
Abstract—We study network optimization that considers energy minimization as an objective. Studies have shown that mechanisms such as speed scaling can significantly reduce the ...
Matthew Andrews, Antonio Fernández, Lisa Zh...