1420 search results - page 142 / 284 » Representation of Graphs by OBDDs |
178
click to vote
ACSC
2002
IEEE
15 years 11 months ago
2002
IEEE
We propose a flow-sensitive alias analysis algorithm that computes safe and efficient alias sets in Java. For that, we propose a references-set representation of aliased elements,...
199
click to vote
PODC
2010
ACM
15 years 10 months ago
2010
ACM
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
178
click to vote
DALT
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. This paper offers a formalization of iterated belief revision for multiagent communication using the logic of communication graphs introduced in [15]. In this study we co...
163
click to vote
DMIN
2007
15 years 8 months ago
2007
—In this paper we present graph-based approaches to mining for anomalies in domains where the anomalies consist of unexpected entity/relationship alterations that closely resembl...
164
click to vote
NN
2006
Springer
15 years 6 months ago
2006
Springer
- Contiguity Analysis is a straightforward generalization of Linear Discriminant Analysis in which the partition of elements is replaced by a more general graph structure. Applied ...