1420 search results - page 145 / 284 » Representation of Graphs by OBDDs |
164
click to vote
INFOVIS
2000
IEEE
15 years 11 months ago
2000
IEEE
We describe MGV, an integrated visualization and exploration system for massive multi-digraph navigation. MGV’s only assumption is that the vertex set of the underlying digraph ...
215
click to vote
SIGSOFT
1994
ACM
15 years 10 months ago
1994
ACM
Program slicing is a fundamental operation for many software engineering tools. Currently, the most efficient algorithm for interprocedural slicing is one that uses a program repr...
171
click to vote
RSS
2007
15 years 8 months ago
2007
— Several recent algorithms have formulated the SLAM problem in terms of non-linear pose graph optimization. These algorithms are attractive because they offer lower computationa...
167
click to vote
JEC
2006
15 years 6 months ago
2006
Many applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). In our previous work, we proposed a ...
165
click to vote
JETAI
1998
15 years 6 months ago
1998
Graphical structures such as Bayesian networks or Markov networks are very useful tools for representing irrelevance or independency relationships, and they may be used to e cientl...