Abstract. We describe a method for enumerating all essentially different executions possible for a cryptographic protocol. We call them the shapes of the protocol. Naturally occur...
Shaddin F. Doghmi, Joshua D. Guttman, F. Javier Th...
Object recognition and content-based image retrieval systems rely heavily on the accurate and efficient identification of shapes. A fundamental requirement in the shape analysis p...
Dragomir Yankov, Eamonn J. Keogh, Li Wei, Xiaopeng...
Background: We present an approach designed to identify gene regulation patterns using sequence and expression data collected for Saccharomyces cerevisae. Our main goal is to rela...
Bartek Wilczynski, Torgeir R. Hvidsten, Andriy Kry...
In this paper we study the community structure of endorsement networks, i.e., social networks in which a directed edge u → v is asserting an action of support from user u to use...
Guillermo Garrido, Francesco Bonchi, Aristides Gio...
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...