3874 search results - page 306 / 775 » Approximation Algorithms for k-hurdle Problems |
128
click to vote
PDPTA
2007
15 years 6 months ago
2007
Abstract In this paper we investigate the composition of cheap network storage resources to meet specific availability and capacity requirements. We show that the problem of find...
143
Voted
CORR
2010
Springer
14 years 12 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
177
Voted
HSNMC
2003
Springer
15 years 10 months ago
2003
Springer
Various Internet applications involve multiple parties and usually adopt a one-to-many communication paradigm (multicast). The presence of multiple receivers in a multicast session...
155
Voted
CATS
2006
15 years 6 months ago
2006
We study the problem of orienting the edges of a weighted graph such that the maximum weighted outdegree of vertices is minimized. This problem, which has applications in the guar...
144
click to vote
SDM
2009
SIAM
16 years 2 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: (...