Sciweavers

1206 search results - page 46 / 242
» Arc-Flags in Dynamic Graphs
Sort
View
STOC
2010
ACM
170views Algorithms» more  STOC 2010»
14 years 2 months ago
Connectivity oracles for failure prone graphs
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
Ran Duan, Seth Pettie
IPMI
2007
Springer
14 years 4 months ago
Segmentation of Sub-cortical Structures by the Graph-Shifts Algorithm
Abstract. We propose a novel algorithm called graph-shifts for performing image segmentation and labeling. This algorithm makes use of a dynamic hierarchical representation of the ...
Jason J. Corso, Zhuowen Tu, Alan L. Yuille, Arthur...
CORR
2011
Springer
149views Education» more  CORR 2011»
13 years 5 months ago
General Iteration graphs and Boolean automata circuits
This article is set in the eld of regulation networks modeled by discrete dynamical systems. It focuses on Boolean automata networks. In such networks, there are many ways to upd...
Mathilde Noual
MICS
2008
72views more  MICS 2008»
13 years 10 months ago
Dynamic Multi-level Overlay Graphs for Shortest Paths
Multi-level overlay graphs represent a speed-up technique for shortest paths computation which is based on a hierarchical decomposition of a weighted directed graph G. They have b...
Francesco Bruera, Serafino Cicerone, Gianlorenzo D...
IPPS
1999
IEEE
14 years 2 months ago
A Graph Based Framework to Detect Optimal Memory Layouts for Improving Data Locality
In order to extract high levels of performance from modern parallel architectures, the effective management of deep memory hierarchies is very important. While architectural advan...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...