Sciweavers

3096 search results - page 30 / 620
» The Generalized FITC Approximation
Sort
View
SIGECOM
2011
ACM
232views ECommerce» more  SIGECOM 2011»
12 years 11 months ago
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
11 years 11 months ago
Constant factor approximation algorithm for the knapsack median problem
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
Amit Kumar
JACM
2000
131views more  JACM 2000»
13 years 8 months ago
The soft heap: an approximate priority queue with optimal error rate
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
Bernard Chazelle
SIAMCO
2002
71views more  SIAMCO 2002»
13 years 8 months ago
Rate of Convergence for Constrained Stochastic Approximation Algorithms
There is a large literature on the rate of convergence problem for general unconstrained stochastic approximations. Typically, one centers the iterate n about the limit point then...
Robert Buche, Harold J. Kushner
ICANN
2011
Springer
13 years 2 days ago
Learning Curves for Gaussian Processes via Numerical Cubature Integration
This paper is concerned with estimation of learning curves for Gaussian process regression with multidimensional numerical integration. We propose an approach where the recursion e...
Simo Särkkä