2698 search results - page 253 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
186
click to vote
KDD
2000
ACM
15 years 10 months ago
2000
ACM
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
184
click to vote
APIN
2010
15 years 6 months ago
2010
Abstract. This paper introduces a robust variant of AdaBoost, cwAdaBoost, that uses weight perturbation to reduce variance error, and is particularly effective when dealing with da...
184
click to vote
RCIS
2010
15 years 5 months ago
2010
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
186
click to vote
ALGORITHMICA
2008
15 years 6 months ago
2008
The notion of -kernel was introduced by Agarwal et al. [5] to set up a unified framework for computing various extent measures of a point set P approximately. Roughly speaking, a ...
195
click to vote
WAOA
2005
Springer
16 years 2 days ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...