Sciweavers

118 search results - page 8 / 24
» Fast distributed graph partition and application
Sort
View
ICAS
2006
IEEE
143views Robotics» more  ICAS 2006»
14 years 1 months ago
Towards Autonomic Distribution of Existing Object Oriented Programs
By harnessing computational power of distributed heterogeneous resources, it is possible to build a large scale integrated system so that a centralized program is partitioned and ...
Debzani Deb, M. Muztaba Fuad, Michael J. Oudshoorn
GRID
2010
Springer
13 years 4 months ago
Dynamic Partitioning of GATE Monte-Carlo Simulations on EGEE
Abstract The EGEE grid offers the necessary infrastructure and resources for reducing the running time of particle tracking Monte-Carlo applications like GATE. However, efforts are...
Sorina Camarasu-Pop, Tristan Glatard, Jakub T. Mos...
PODC
2009
ACM
14 years 8 months ago
Fast distributed random walks
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
Atish Das Sarma, Danupon Nanongkai, Gopal Panduran...
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
12 years 10 months ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...
ICMCS
2007
IEEE
125views Multimedia» more  ICMCS 2007»
14 years 1 months ago
A Framework for Provisioning Overlay Network Based Multimedia Distribution Services
In this paper, we present a graph-theoretic framework for provisioning overlay network based multimedia distribution services to a diverse set of receivers. Considering resource l...
Dewan Tanvir Ahmed, Shervin Shirmohammadi