Graph edit distance provides an error-tolerant way to measure distances between attributed graphs. The effectiveness of edit distance based graph classification algorithms relies ...
Quantum error-correction codes (QECCs) are a vital ingredient of quantum computation and communication systems. In that context it is highly desirable to design QECCs that can be r...
In this paper we present GRASPER, a graph constraint solver, based on set constraints. We specify GRASPER’s constraints and we make use of our framework to model a problem in the...
Understanding the ways in which information achieves widespread public awareness is a research question of significant interest. We consider whether, and how, the way in which th...
Indoor navigation highly depends on context and requires flexible data structures to support the many use cases and configurations. For example, an indoor navigation system must c...