In this paper, we survey and compare different algorithms that, given an overcomplete dictionary of elementary functions, solve the problem of simultaneous sparse signal approxim...
In this paper we survey the major developments in understanding the complexity of the graph connectivity problem in several computational models, and highlight some challenging op...
Methodologies to find and evaluate solutions for ontology matching should be centered on the practical problems to be solved. In this paper we look at matching from the perspectiv...
Zharko Aleksovski, Willem Robert van Hage, Antoine...
In the counting problem, asynchronous concurrent processes repeatedly assign themselves successive values, such as integers or locations in memory. Counting networks are a class o...
Grammatical inference (or grammar inference) has been applied to various problems in areas such as computational biology, and speech and pattern recognition but its application to...