Sciweavers

365 search results - page 41 / 73
» Reconfigurations in Graphs and Grids
Sort
View
ACSW
2007
14 years 12 days ago
DGRID: A DHT-Based Resource Indexing and Discovery Scheme for Computational Grids
Traditional DHT (Distributed Hash Tables) abstraction distributes data items among peer nodes on a structured overlay network. This introduces a number of issues when nodes are un...
Verdi March, Yong Meng Teo, Xianbing Wang
AINA
2007
IEEE
14 years 5 months ago
Grid-Aware Evaluation of Regular Path Queries on Spatial Networks
Regular path queries (RPQs), expressed as regular expressions over the alphabet of database edge-labels, are commonly used for guided navigation of graph databases. While convenie...
Zhuo Miao, Dan C. Stefanescu, Alex Thomo
JMIV
2008
97views more  JMIV 2008»
13 years 11 months ago
Fusion Graphs: Merging Properties and Watersheds
Region merging methods consist of improving an initial segmentation by merging some pairs of neighboring regions. In this paper, we consider a segmentation as a set of connected r...
Jean Cousty, Gilles Bertrand, Michel Couprie, Laur...
IPPS
2010
IEEE
13 years 9 months ago
Executing task graphs using work-stealing
Abstract--NABBIT is a work-stealing library for execution of task graphs with arbitrary dependencies which is implemented as a library for the multithreaded programming language Ci...
Kunal Agrawal, Charles E. Leiserson, Jim Sukha
CORR
2008
Springer
138views Education» more  CORR 2008»
13 years 11 months ago
Order-Optimal Consensus through Randomized Path Averaging
Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust message-passing schemes for distributed information processing over...
Florence Bénézit, Alexandros G. Dima...