118 search results - page 4 / 24 » Fast distributed graph partition and application |
139
click to vote
KDD
2005
ACM
16 years 4 months ago
2005
ACM
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
121
Voted
IPPS
2003
IEEE
15 years 9 months ago
2003
IEEE
Graphic cards performance increase and fast Internet connections are popularising Networked Virtual Environments. This immature paradigm of real-time applications has still to sol...
130
Voted
SC
2005
ACM
15 years 9 months ago
2005
ACM
Many emerging large-scale data science applications require searching large graphs distributed across multiple memories and processors. This paper presents a distributed breadth...
110
Voted
ICCAD
1997
IEEE
15 years 7 months ago
1997
IEEE
This paper presents the underlying methodology of Cosmos, an interactive approach for hardware software co-design capable of handling multiprocessor systems and distributed archit...
180
Voted
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
Parallel applications based on irregular meshes make use of mesh partitioners for efficient execution. Some mesh partitioners can map a mesh to a heterogeneous computational plat...