2034 search results - page 105 / 407 » On the Comparability of Software Clustering Algorithms |
SDM
2007
SIAM
13 years 9 months ago
2007
SIAM
We propose the use of random projections with a sparse matrix to maintain a sketch of a collection of high-dimensional data-streams that are updated asynchronously. This sketch al...
HM
2007
Springer
14 years 2 months ago
2007
Springer
This paper deals with the Permutation Flow Shop scheduling problem with the objective of minimizing total flow time, and therefore reducing in-process inventory. A new hybrid meta...
ESIAT
2009
IEEE
13 years 5 months ago
2009
IEEE
Comparing with the rapidly increasing acquiring technology for remotely sensed data, the data processing technologies have been following behind, especially in computing speed and ...
BMCBI
2007
13 years 8 months ago
2007
Background: Mean-based clustering algorithms such as bisecting k-means generally lack robustness. Although componentwise median is a more robust alternative, it can be a poor cent...
ICPR
2008
IEEE
14 years 2 months ago
2008
IEEE
Many applications require matching objects to a predefined, yet highly dynamic set of categories accompanied by category descriptions. We present a novel approach to solving this...