Sciweavers

4074 search results - page 208 / 815
» Abstract Graph Transformation
Sort
View
217
Voted
MICRO
2012
IEEE
285views Hardware» more  MICRO 2012»
13 years 5 months ago
Automatic Extraction of Coarse-Grained Data-Flow Threads from Imperative Programs
This article presents a general algorithm for transforming sequential imperative programs into parallel data-flow programs. Our algorithm operates on a program dependence graph i...
Feng Li, Antoniu Pop, Albert Cohen
121
Voted
SAMT
2009
Springer
135views Multimedia» more  SAMT 2009»
15 years 9 months ago
Exploring Relationships between Annotated Images with the ChainGraph Visualization
Abstract. Understanding relationships and commonalities between digital contents based on metadata is a difficult user task that requires sophisticated presentation forms. In this ...
Steffen Lohmann, Philipp Heim, Lena Tetzlaff, Thom...
99
Voted
WG
2005
Springer
15 years 8 months ago
Collective Tree 1-Spanners for Interval Graphs
Abstract. In this paper we study the existence of a small set T of spanning trees that collectively “1-span” an interval graph G. In particular, for any pair of vertices u, v w...
Derek G. Corneil, Feodor F. Dragan, Ekkehard K&oum...
115
Voted
TKDE
2008
154views more  TKDE 2008»
15 years 2 months ago
Analyzing the Structure and Evolution of Massive Telecom Graphs
Abstract-- With ever growing competition in telecommunications markets, operators have to increasingly rely on business intelligence to offer the right incentives to their customer...
Amit Anil Nanavati, Rahul Singh, Dipanjan Chakrabo...
IPL
2007
94views more  IPL 2007»
15 years 2 months ago
A note on the Hadwiger number of circular arc graphs
Abstract. The intention of this note is to motivate the researchers to study Hadwiger’s conjecture for circular arc graphs. Let η(G) denote the largest clique minor of a graph G...
N. S. Narayanaswamy, Naveen Belkale, L. Sunil Chan...