Sciweavers

361 search results - page 5 / 73
» Algorithms for Extracting Timeliness Graphs
Sort
View
MICRO
2012
IEEE
285views Hardware» more  MICRO 2012»
11 years 10 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
CODES
2006
IEEE
14 years 1 months ago
Automatic run-time extraction of communication graphs from multithreaded applications
Embedded system synthesis, multiprocessor synthesis, and thread assignment policy design all require detailed knowledge of the runtime communication patterns among different threa...
Ai-Hsin Liu, Robert P. Dick
IJSNET
2007
95views more  IJSNET 2007»
13 years 7 months ago
On extracting consistent graphs in wireless sensor networks
: Robustness and security of services like localisation, routing and time synchronisation in Wireless Sensor Networks (WSNs) have been critical issues. Efficient mathematical (gra...
Murtuza Jadliwala, Qi Duan, Jinhui Xu, Shambhu J. ...
KDD
2006
ACM
122views Data Mining» more  KDD 2006»
14 years 7 months ago
Measuring and extracting proximity in networks
Measuring distance or some other form of proximity between objects is a standard data mining tool. Connection subgraphs were recently proposed as a way to demonstrate proximity be...
Yehuda Koren, Stephen C. North, Chris Volinsky
ICCAD
1999
IEEE
120views Hardware» more  ICCAD 1999»
13 years 11 months ago
Regularity extraction via clan-based structural circuit decomposition
Identifying repeating structural regularities in circuits allows the minimization of synthesis, optimization, and layout e orts. We introduce in this paper a novel method for ident...
Soha Hassoun, Carolyn McCreary