1403 search results - page 15 / 281 » Set cover algorithms for very large datasets |
SSD
2005
Springer
14 years 1 months ago
2005
Springer
Assume that a franchise plans to open k branches in a city, so that the average distance from each residential block to the closest branch is minimized. This is an instance of the ...
ICALP
2010
Springer
14 years 1 months ago
2010
Springer
The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today. What should...
SDM
2009
SIAM
14 years 5 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: (...
SIGIR
2006
ACM
14 years 2 months ago
2006
ACM
Large scale learning is often realistic only in a semi-supervised setting where a small set of labeled examples is available together with a large collection of unlabeled data. In...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
Automated event extraction remains a very difficult challenge requiring information analysts to manually identify key events of interest within massive, dynamic data. Many techniq...