1285 search results - page 108 / 257 » On the Complexity of Ordinal Clustering |
ICPADS
1998
IEEE
15 years 2 months ago
1998
IEEE
The DAG-based task graph model has been found effective in scheduling for performance prediction and optimization of parallel applications. However the scheduling complexity and s...
137
click to vote
CONPAR
1994
15 years 2 months ago
1994
The Rewrite Rule Machine (RRM) is a massively parallel MIMD/SIMD computer designed with the explicit purpose of supporting veryhigh-level parallel programming with rewrite rules. T...
CLUSTER
2004
IEEE
15 years 1 months ago
2004
IEEE
The complexity and cost of isolating the root cause of system problems in large parallel computers generally scales with the size of the system. Syslog messages provide a primary ...
LREC
2008
14 years 11 months ago
2008
We present a study of the word interaction networks of Bengali in the framework of complex networks. The topological properties of these networks reveal interesting insights into ...
ISCAPDCS
2007
14 years 11 months ago
2007
With rapid increase of parallel computation systems in their sizes, it is inevitable to develop algorithms that are applicable even if there exist faulty elements in the systems. ...