1420 search results - page 43 / 284 » Representation of Graphs by OBDDs |
148
click to vote
ESOP
2010
Springer
16 years 3 months ago
2010
Springer
Detailed memory models that expose individual fields are necessary to precisely analyze code that makes use of low-level aspects such as, pointers to fields and untagged unions. Ye...
167
click to vote
CSCWD
2007
Springer
16 years 10 days ago
2007
Springer
The context of a collective activity is characterized by all information produced during the activity. The comprehension of this context by each actor is essential for the success...
153
click to vote
ICPR
2006
IEEE
16 years 7 months ago
2006
IEEE
We present a computationally efficient, on-line graph structure estimation method for model-based scene interpretation. Different scenes have different hierarchical graphical mode...
180
click to vote
UAI
2008
15 years 7 months ago
2008
Chordal graphs can be used to encode dependency models that are representable by both directed acyclic and undirected graphs. This paper discusses a very simple and efficient algo...
166
click to vote
GD
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Many graph drawing algorithms use st-numberings (st-orientations or bipolar orientations) as a first step. An st-numbering of a biconnected undirected graph defines a d...