1161 search results - page 81 / 233 » Approximation schemes for clustering problems |
118
click to vote
WISE
2002
Springer
15 years 4 months ago
2002
Springer
In this paper, we introduce a novel framework for clustering web data which is often heterogeneous in nature. As most existing methods often integrate heterogeneous data into a un...
104
click to vote
PVLDB
2008
14 years 10 months ago
2008
Data clustering is a difficult problem due to the complex and heterogeneous natures of multidimensional data. To improve clustering accuracy, we propose a scheme to capture the lo...
111
click to vote
AAAI
2008
15 years 2 months ago
2008
This paper considers the problem of an agent searching for a resource or a tangible good in a physical environment, where at each stage of its search it observes one source where ...
GECCO
2008
Springer
15 years 29 days ago
2008
Springer
Recent advances in XCS technology have shown that selfadaptive mutation can be highly useful to speed-up the evolutionary progress in XCS. Moreover, recent publications have shown...
118
click to vote
SCIA
2009
Springer
15 years 6 months ago
2009
Springer
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...