Sciweavers

1285 search results - page 108 / 257
» On the Complexity of Ordinal Clustering
Sort
View
ICPADS
1998
IEEE
14 years 2 months ago
Symbolic Partitioning and Scheduling of Parameterized Task Graphs
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...
Michel Cosnard, Emmanuel Jeannot, Tao Yang
CONPAR
1994
14 years 2 months ago
The Rewrite Rule Machine Node Architecture and Its Performance
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...
Patrick Lincoln, José Meseguer, Livio Ricci...
CLUSTER
2004
IEEE
14 years 1 months ago
Towards informatic analysis of Syslogs
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 ...
John Stearley
LREC
2008
102views Education» more  LREC 2008»
13 years 11 months ago
Unsupervised Parts-of-Speech Induction for Bengali
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 ...
Joy Deep Nath, Monojit Choudhury, Animesh Mukherje...
ISCAPDCS
2007
13 years 11 months ago
A Node-to-set cluster-fault-tolerant disjoint routing algorithm in pancake graphs
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. ...
Tatsuro Watanabe, Keiichi Kaneko, Shietung Peng