852 search results - page 102 / 171 » Using graph parsing for automatic graph drawing |
ESWS
2009
Springer
15 years 4 months ago
2009
Springer
We consider the problem of tag prediction in collaborative tagging systems where users share and annotate resources on the Web. We put forward HAMLET, a novel approach to automatic...
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
We show that the downward-closure of a Petri net language is effectively computable. This is mainly done by using the notions defined for showing decidability of the reachability...
IPPS
1998
IEEE
15 years 2 months ago
1998
IEEE
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
DAC
1995
ACM
15 years 1 months ago
1995
ACM
- We introduce a transformation, named rephasing, that manipulates the timing parameters in control-dataflow graphs. Traditionally high-level synthesis systems for DSP have either ...
ACII
2005
Springer
15 years 1 days ago
2005
Springer
Active Shape Model (ASM) is one of the most powerful statistical tools for face image alignment. In this paper, we propose a novel method, called Bunch-Active Shape Model (Bunch-AS...