691 search results - page 84 / 139 » Non-negative graph embedding |
WADT
1997
Springer
14 years 6 days ago
1997
Springer
The dynamic behavior of rule-based systems (like term rewriting systems 24], process algebras 27], and so on) can be traditionally determined in two orthogonal ways. Either operati...
GD
1995
Springer
13 years 11 months ago
1995
Springer
It is a di cult problem to display large, complex graphs in a manner which furthers comprehension. A useful approach is to expand selected sections foci of the graph revealing de...
DCOSS
2008
Springer
13 years 9 months ago
2008
Springer
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...
IADIS
2008
13 years 9 months ago
2008
We present how to efficiently mine a set of directed acyclic graphs (DAGs) for unconnected, both multi- or single-rooted, and induced fragments. With a new canonical form that is ...
DAC
2005
ACM
14 years 9 months ago
2005
ACM
Signal processing and multimedia applications are often implemented on resource constrained embedded systems. It is therefore important to find implementations that use as little ...