157 search results - page 19 / 32 » Compact representations of separable graphs |
139
click to vote
SYNASC
2008
IEEE
15 years 9 months ago
2008
IEEE
We formalize paper fold (origami) by graph rewriting. Origami tion is abstractly described by a rewrite system (O, ), where set of abstract origami’s and is a binary relation on ...
128
click to vote
VIZSEC
2005
Springer
15 years 8 months ago
2005
Springer
While efficient graph-based representations have been developed for modeling combinations of low-level network attacks, relatively little attention has been paid to effective tech...
116
click to vote
TPHOL
2007
IEEE
15 years 9 months ago
2007
IEEE
Abstract. In this proof pearl, we demonstrate the power of higherorder encodings in the logical framework Twelf[PS99] by investigating proofs about an algorithmic specification of...
121
click to vote
PAMI
2007
15 years 2 months ago
2007
—Over the past few decades, a large family of algorithms—supervised or unsupervised; stemming from statistics or geometry theory—has been designed to provide different soluti...
140
click to vote
JSYML
2011
14 years 10 months ago
2011
Abstract. Louveau and Rosendal [5] have shown that the relation of biembeddability for countable graphs as well as for many other natural classes of countable structures is complet...