Sciweavers

2473 search results - page 30 / 495
» The Logic of Communication Graphs
Sort
View
ICDCN
2011
Springer
12 years 11 months ago
Mining Frequent Subgraphs to Extract Communication Patterns in Data-Centres
In this paper, we propose to use graph-mining techniques to understand the communication pattern within a data-centre. We model the communication observed within a data-centre as a...
Maitreya Natu, Vaishali P. Sadaphal, Sangameshwar ...
ICCAD
2003
IEEE
188views Hardware» more  ICCAD 2003»
14 years 4 months ago
Communication-Aware Task Scheduling and Voltage Selection for Total Systems Energy Minimization
Abstract: In this paper, we present an interprocessor communication-aware task scheduling algorithm applicable to a multiprocessor system executing an application with dependent ta...
Girish Varatkar, Radu Marculescu
IV
2005
IEEE
131views Visualization» more  IV 2005»
14 years 1 months ago
A Framework for Visualising Large Graphs
Visualising large graphs faces the challenges of both data complexity and visual complexity. This paper presents a framework for visualising large graphs that reduces data complex...
Wanchun Li, Seok-Hee Hong, Peter Eades
ICDM
2009
IEEE
197views Data Mining» more  ICDM 2009»
13 years 5 months ago
A Linear-Time Graph Kernel
The design of a good kernel is fundamental for knowledge discovery from graph-structured data. Existing graph kernels exploit only limited information about the graph structures bu...
Shohei Hido, Hisashi Kashima
APN
2007
Springer
14 years 1 months ago
A Compositional Method for the Synthesis of Asynchronous Communication Mechanisms
Asynchronous data communication mechanisms (ACMs) have been extensively studied as data connectors between independently timed concurrent processes. In previous work, an automatic ...
Kyller Costa Gorgônio, Jordi Cortadella, Fei...