Sciweavers

6598 search results - page 455 / 1320
» Graph Theory with Applications
Sort
View
CRIWG
2007
15 years 8 months ago
Coordinating Multi-task Environments Through the Methodology of Relations Graph
Abstract. This paper presents Relations Graph – GR a methodology to automate the generation of coordination mechanisms in computational environments. GR explores encapsulation an...
Adailton José Alves Da Cruz, Léo Pin...
ISCAPDCS
2007
15 years 8 months ago
A Node-to-set cluster-fault-tolerant disjoint routing algorithm in pancake graphs
With rapid increase of parallel computation systems in their sizes, it is inevitable to develop algorithms that are applicable even if there exist faulty elements in the systems. ...
Tatsuro Watanabe, Keiichi Kaneko, Shietung Peng
CORR
2010
Springer
124views Education» more  CORR 2010»
15 years 7 months ago
Component Evolution in General Random Intersection Graphs
Abstract. Random intersection graphs (RIGs) are an important random structure with algorithmic applications in social networks, epidemic networks, blog readership, and wireless sen...
Milan Bradonjic, Aric A. Hagberg, Nicolas W. Henga...
CSJM
2006
76views more  CSJM 2006»
15 years 6 months ago
Graph Coloring using Peer-to-Peer Networks
The popularity of distributed file systems continues to grow in last years. The reasons they are preferred over traditional centralized systems include fault tolerance, availabili...
Adrian Iftene, Cornelius Croitoru
CORR
2004
Springer
223views Education» more  CORR 2004»
15 years 6 months ago
Better Foreground Segmentation Through Graph Cuts
For many tracking and surveillance applications, background subtraction provides an effective means of segmenting objects moving in front of a static background. Researchers have ...
Nicholas R. Howe, Alexandra Deschamps