3396 search results - page 406 / 680 » Tree representations of graphs |
220
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...
173
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...
169
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 ...
169
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...
186
click to vote
CDC
2009
IEEE
15 years 10 months ago
2009
IEEE
Distributed decision making in networked systems depends critically on the timely availability of critical fresh information. Performance of networked systems, from the perspective...