725 search results - page 29 / 145 » A General Greedy Approximation Algorithm with Applications |
107
click to vote
JMLR
2012
13 years 3 days ago
2012
We study the prevalent problem when a test distribution differs from the training distribution. We consider a setting where our training set consists of a small number of sample d...
150
click to vote
SODA
2012
ACM
13 years 2 days ago
2012
ACM
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...
110
click to vote
COMPGEOM
2008
ACM
14 years 11 months ago
2008
ACM
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
SIAMCO
2002
14 years 9 months ago
2002
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...
ESA
2010
Springer
14 years 10 months ago
2010
Springer
In a Content Distribution Network application, we have a set of servers and a set of clients to be connected to the servers. Often there are a few server types and a hard budget co...