Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
This paper describes the Patent Retrieval Task in the Fourth NTCIR Workshop, and the test collections produced in this task. We perform the invalidity search task, in which each p...
Abstract. This paper presents how Self-Organizing Maps and especially Kohonen maps can be applied to digital images of ancient collections in the perspective of valorization and di...
This paper describes a process for selecting and evaluating candidates for component based software engineering. The process is aimed at developers sourcing components from third ...
Line detection algorithms constitute the basis for technical document analysis and recognition. The performance of these algorithms decreases as the quality of the documents degra...