2698 search results - page 87 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
155
click to vote
MFCS
2004
Springer
15 years 11 months ago
2004
Springer
We study the on-line versions of two fundamental graph problems, maximum independent set and minimum coloring, for the case of disk graphs which are graphs resulting from intersect...
151
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...
156
click to vote
EWSN
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. In this paper, we consider the minimization of a relevant energy consumption related cost function in the context of sensor networks where correlated sources are generate...
159
click to vote
CINQ
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
149
click to vote
PAMI
2008
15 years 6 months ago
2008
We consider the problem of learning a ranking function that maximizes a generalization of the Wilcoxon-Mann-Whitney statistic on the training data. Relying on an -accurate approxim...