7150 search results - page 436 / 1430 » An Approximation Algorithm for Approximation Rank |
211
click to vote
SODA
2010
ACM
15 years 4 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
191
click to vote
SDM
2009
SIAM
16 years 4 months ago
2009
SIAM
In this paper, we propose GAD (General Activity Detection) for fast clustering on large scale data. Within this framework we design a set of algorithms for different scenarios: (...
192
click to vote
ALGORITHMICA
2008
15 years 7 months ago
2008
The notion of -kernel was introduced by Agarwal et al. [5] to set up a unified framework for computing various extent measures of a point set P approximately. Roughly speaking, a ...
184
click to vote
TNN
1998
15 years 6 months ago
1998
— In this paper, we perform a complete asymptotic performance analysis of the stochastic approximation algorithm (denoted subspace network learning algorithm) derived from Oja’...
178
click to vote
COR
2007
15 years 6 months ago
2007
We present new primal-dual algorithms for several network design problems. The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree proble...