We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...
This article presents the CHIP demonstrator5 for providing personalized access to digital museum collections. It consists of three main components: Art Recommender, Tour Wizard, an...
Yiwen Wang, Natalia Stash, Lora Aroyo, Peter Gorge...
The paper describes a new software package for automated estimation, display and analyses of various drought indices – continuous functions of precipitation that allow quantitat...
- This paper presents a model that enables the optimal interpretation of Prognostics and Health Management (PHM) results for electronic systems. In this context, optimal interpreta...
Consider a collection of r identical asynchronous mobile agents dispersed on an arbitrary anonymous network of size n. The agents all execute the same protocol and move from node ...