Sciweavers

774 search results - page 10 / 155
» A New Graph Triconnectivity Algorithm and Its Parallelizatio...
Sort
View
SIGSOFT
1994
ACM
13 years 11 months ago
A New Model of Program Dependences for Reverse Engineering
A dependence model for reverse engineering should treat procedures in a modular fashion and should be fine-grained, distinguishing dependences that are due to different variables....
Daniel Jackson, Eugene J. Rollins
TKDE
2002
239views more  TKDE 2002»
13 years 7 months ago
An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps
In this paper, we have developed a HiTi (Hierarchical MulTi) graph model for structuring large topographical road maps to the minimum cost route computation. The HiTi graph model p...
Sungwon Jung, Sakti Pramanik
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
APWEB
2005
Springer
14 years 1 months ago
An LOD Model for Graph Visualization and Its Application in Web Navigation
This paper presents a new method for visualizing and navigating huge graphs. The main feature of this method is that it applies Level-Of-Detail (LOD) strategy to graph visualizati...
Shixia Liu, Yue Pan, Liping Yang, Wenyin Liu
ASP
2005
Springer
14 years 1 months ago
A New Algorithm for Answer Set Computation
A new exact algorithm for computing answer sets of logic programs is presented and analyzed. The algorithm takes a logic program in Kernel normal form as an input and computes its ...
Giuliano Grossi, Massimo Marchi