We investigate the complexity of enumerating pseudo-intents in the lectic order. We look at the following decision problem: Given a formal context and a set of n pseudo-intents det...
—Mobile ad-hoc networks (MANETs) usually contain sparse or even empty regions called holes. The local optimum problem will occur when routing packets meet holes in the network. I...
For formal verification of hardware Satisfiability Modulo Theory (SMT) solvers are increasingly applied. Today’s state-of-the-art SMT solvers use different techniques like ter...
Real-world image sequences (e.g., recorded for vision-based driver assistance) are typically degraded by various types of noise, changes in lighting, out-of-focus lenses, differin...
— This paper introduces a novel method, GAIS, for detecting interleaved sequential patterns from databases. A case, where data is of low quality and has errors is considered. Pat...