852 search results - page 46 / 171 » Using graph parsing for automatic graph drawing |
DAC
1995
ACM
14 years 1 days ago
1995
ACM
––This paper describes algorithms for automatic layout synthesisofleafcellsin1–dandinanew1–1/2–dlayoutstyle,useful for non–dual circuit styles. The graph theory based a...
CPE
1994
Springer
14 years 18 days ago
1994
Springer
When implementingparallel programs forparallel computer systems the performancescalability of these programs should be tested and analyzed on different computer configurations and...
CADE
2001
Springer
14 years 1 months ago
2001
Springer
The dependency pair method of Arts and Giesl is the most powerful technique for proving termination of term rewrite systems automatically. We show that the method can be improved b...
KDD
2008
ACM
2008
ACM
Knowledge discovery of semantic relationships between words using nonparametric bayesian graph model
14 years 9 months ago
We developed a model based on nonparametric Bayesian modeling for automatic discovery of semantic relationships between words taken from a corpus. It is aimed at discovering seman...
GPC
2010
Springer
14 years 15 days ago
2010
Springer
Abstract. Large-scale distributed computing applications require concurrent programming models that support modular and compositional software development. The actor model supports...