spectives. A total of 149 abstracts were accepted and presented in the poster session and 31 of them were selected for oral presentation. At the opening of the meeting, Roderic Gui...
Background: The main aim of this study was to develop and implement an algorithm for the rapid, accurate and automated identification of paths leading from buried protein clefts, ...
Stemming algorithms find canonical forms for inflected words, e. g. for declined nouns or conjugated verbs. Since such a unification of words with respect to gender, number, time, ...
Mining frequent subgraphs is an area of research where we have a given set of graphs, and where we search for (connected) subgraphs contained in many of these graphs. Each graph ca...
Edgar H. de Graaf, Joost N. Kok, Walter A. Kosters
This paper presents a hierarchical lane detection system with the ability to deal with both structured and unstructured roads. The proposed system classifies the environment first...