628 search results - page 117 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
FOCS
2004
IEEE
15 years 3 months ago
2004
IEEE
The need to deal with massive data sets in many practical applications has led to a growing interest in computational models appropriate for large inputs. The most important quali...
WWW
2005
ACM
16 years 10 days ago
2005
ACM
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approxi...
121
click to vote
SIGMETRICS
2011
ACM
14 years 2 months ago
2011
ACM
The massive data streams observed in network monitoring, data processing and scientific studies are typically too large to store. For many applications over such data, we must ob...
107
click to vote
NOMS
2002
IEEE
15 years 4 months ago
2002
IEEE
We present fault localization techniques suitable for diagnosing end-to-end service problems in communication systems with complex topologies. We refine a layered system model th...
113
click to vote
ISAAC
2010
Springer
14 years 9 months ago
2010
Springer
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...