Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
Similarity search usually encounters a serious problem in the high dimensional space, known as the “curse of dimensionality”. In order to speed up the retrieval efficiency, p...
This paper introduces an architectural style for enabling end-users to quickly design and deploy software systems in domains characterized by highly personalized and dynamic requi...
Abstract. The complexity of today's embedded systems and their development trajectories requires a systematic, model-driven design approach, supported by tooling wherever poss...
Twan Basten, Emiel van Benthum, Marc Geilen, Marti...
— To generate plans for collecting data for data mining, an important problem is information volatility during planning: the information needed by the planning system may change ...