Sciweavers

1420 search results - page 48 / 284
» Representation of Graphs by OBDDs
Sort
View
PPOPP
2012
ACM
14 years 1 months ago
Massively parallel breadth first search using a tree-structured memory model
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...
Tom St. John, Jack B. Dennis, Guang R. Gao
TALG
2008
127views more  TALG 2008»
15 years 6 months ago
Fully dynamic algorithms for chordal graphs and split graphs
We present the rst dynamic algorithm that maintains a clique tree representation of a chordal graph and supports the following operations: (1) query whether deleting or inserting ...
Louis Ibarra
JCT
2006
110views more  JCT 2006»
15 years 6 months ago
Branch-width, parse trees, and monadic second-order logic for matroids
Abstract. We introduce "matroid parse trees" which, using only a limited amount of information at each node, can build up the vector representations of matroids of bounde...
Petr Hlinený
BMVC
2000
15 years 7 months ago
Motion Segmentation in Long Image Sequences
Long image sequences provide a wealth of information, which means that a compact representation is needed to efficiently process them. In this paper a novel representation for mot...
Steven Mills, Kevin Novins
LREC
2010
202views Education» more  LREC 2010»
15 years 7 months ago
Can Syntactic and Logical Graphs help Word Sense Disambiguation?
This paper presents a word sense disambiguation (WSD) approach based on syntactic and logical representations. The objective here is to run a number of experiments to compare stan...
Amal Zouaq, Michel Gagnon, Benoît Ozell