Sciweavers

247 search results - page 13 / 50
» Scalable propagation-based call graph construction algorithm...
Sort
View
DAM
2008
92views more  DAM 2008»
13 years 7 months ago
Convex drawings of graphs with non-convex boundary constraints
: In this paper, we study a new problem of convex drawing of planar graphs with non-convex boundary constraints. It is proved that every triconnected plane graph whose boundary is ...
Seok-Hee Hong, Hiroshi Nagamochi
SPAA
2000
ACM
13 years 12 months ago
Fault tolerant networks with small degree
In this paper, we study the design of fault tolerant networks for arrays and meshes by adding redundant nodes and edges. For a target graph G (linear array or mesh in this paper),...
Li Zhang
SBACPAD
2006
IEEE
148views Hardware» more  SBACPAD 2006»
14 years 1 months ago
Scalable Parallel Implementation of Bayesian Network to Junction Tree Conversion for Exact Inference
We present a scalable parallel implementation for converting a Bayesian network to a junction tree, which can then be used for a complete parallel implementation for exact inferen...
Vasanth Krishna Namasivayam, Animesh Pathak, Vikto...
CIVR
2008
Springer
106views Image Analysis» more  CIVR 2008»
13 years 9 months ago
Scalable Markov model-based image annotation
In this paper, we propose a novel Markov model-based formulation for the image annotation problem. In this formulation, we treat image annotation as a graph ranking problem, by de...
Changhu Wang, Lei Zhang, Hong-Jiang Zhang
ISSTA
2012
ACM
11 years 10 months ago
Finding errors in multithreaded GUI applications
To keep a Graphical User Interface (GUI) responsive and active, a GUI application often has a main UI thread (or event dispatching thread) and spawns separate threads to handle le...
Sai Zhang, Hao Lü, Michael D. Ernst