Sciweavers

1221 search results - page 10 / 245
» Balanced graph partitioning
Sort
View
INFOCOM
2009
IEEE
15 years 4 months ago
A Social Network Based Patching Scheme for Worm Containment in Cellular Networks
Abstract—Recently, cellular phone networks have begun allowing third-party applications to run over certain open-API phone operating systems such as Windows Mobile, Iphone and Go...
Zhichao Zhu, Guohong Cao, Sencun Zhu, Supranamaya ...
77
Voted
AAAI
2007
14 years 12 months ago
Graph Partitioning Based on Link Distributions
Existing graph partitioning approaches are mainly based on optimizing edge cuts and do not take the distribution of edge weights (link distribution) into consideration. In this pa...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu
ARSCOM
2002
70views more  ARSCOM 2002»
14 years 9 months ago
On the Number of Graphical Forest Partitions
A graphical partition of the even integer n is a partition of n where each part of the partition is the degree of a vertex in a simple graph and the degree sum of the graph is n. ...
Deborah A. Frank, Carla D. Savage, James A. Seller...
CORR
2011
Springer
149views Education» more  CORR 2011»
14 years 4 months ago
Load-Balancing Spatially Located Computations using Rectangular Partitions
Distributing spatially located heterogeneous workloads is an important problem in parallel scientific computing. We investigate the problem of partitioning such workloads (repres...
Erik Saule, Erdeniz Ö. Bas, Ümit V. &Cce...
90
Voted
CCGRID
2001
IEEE
15 years 1 months ago
Latency Hiding in Dynamic Partitioning and Load Balancing of Grid Computing Applications
The Information Power Grid (IPG) concept developed by NASA is aimed to provide a metacomputing platform for large-scale distributed computations, by hiding the intricacies of a hig...
Sajal K. Das, Daniel J. Harvey, Rupak Biswas