2034 search results - page 97 / 407 » On the Comparability of Software Clustering Algorithms |
GECCO
2010
Springer
13 years 8 months ago
2010
Springer
State machines are a popular method of representing a syshigh level of abstraction that enables developers to gain an overview of the system they represent and quickly understand ...
SIGMETRICS
2004
ACM
14 years 1 months ago
2004
ACM
Binary search tree (BST) based data structures, such as AVL trees, red-black trees, and splay trees, are often used in system software, such as operating system kernels. Choosing ...
ECIR
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. In this paper we show how approximate matrix factorisations can be used to organise document summaries returned by a search engine into meaningful thematic categories. We...
AINA
2003
IEEE
14 years 1 months ago
2003
IEEE
In this paper, we propose an asynchronous cluster video server architecture, which is quite different from synchronous video server architecture in various aspects such as stripin...
ISHPC
2003
Springer
14 years 1 months ago
2003
Springer
There have been many parallel external sorting algorithms reported such as NOW-Sort, SPsort, and hill sort, etc. They are for sorting large-scale data stored in the disk, but they ...