1403 search results - page 68 / 281 » Set cover algorithms for very large datasets |
101
click to vote
MFCS
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
102
click to vote
PVLDB
2011
14 years 4 months ago
2011
Matching problems are ubiquitous. They occur in economic markets, labor markets, internet advertising, and elsewhere. In this paper we focus on an application of matching for soci...
SCALESPACE
1999
Springer
15 years 2 months ago
1999
Springer
Since the work by Osher and Sethian on level-sets algorithms for numerical shape evolutions, this technique has been used for a large number of applications in numerous fields. In...
BMCBI
2006
14 years 9 months ago
2006
Background: Missing value estimation is an important preprocessing step in microarray analysis. Although several methods have been developed to solve this problem, their performan...
106
click to vote
SIGMETRICS
2011
ACM
14 years 18 days ago
2011
ACM
Threshold-based performance monitoring in large 3G networks is very challenging for two main factors: large network scale and dynamics in both time and spatial domains. There exis...