We study a novel problem of mining significant recurrent rules from a sequence database. Recurrent rules have the form "whenever a series of precedent events occurs, eventuall...
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...
Computational analyses of protein structure-function relationships have traditionally been based on sequence homology, fold family analysis and 3D motifs/templates. Previous struct...
Reetal Pai, James C. Sacchettini, Thomas R. Ioerge...
Temporal reasoning is widely used within both Computer Science and A.I. However, the underlying complexity of temporal proof in discrete temporal logics has led to the use of simp...
The present study examines the relative importance of a series of known and expected factors that highly affect threat detection performance in aviation security X-ray screening. E...
Anton Bolfing, Tobias Halbherr, Adrian Schwaninger