153 search results - page 25 / 31 » Minimum cost subpartitions in graphs |
146
click to vote
APCSAC
2005
IEEE
15 years 11 months ago
2005
IEEE
Abstract. Dynamic data redistribution enhances data locality and improves algorithm performance for numerous scientific problems on distributed memory multi-computers systems. Prev...
172
click to vote
COMCOM
2006
15 years 6 months ago
2006
In this paper, we address the routing and wavelength assignment problem for the core-based tree (CBT) service in a wavelength-division-multiplexing (WDM) network, where k sources ...
194
click to vote
WADS
2009
Springer
16 years 19 days ago
2009
Springer
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
153
click to vote
CVPR
2008
IEEE
16 years 15 days ago
2008
IEEE
In this paper, we propose a novel graph based clustering approach with satisfactory clustering performance and low computational cost. It consists of two main steps: tree fitting...
178
click to vote
PPOPP
2005
ACM
15 years 11 months ago
2005
ACM
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...