Constraint relaxation is a frequently used technique for managing over-determined constraint satisfaction problems. A problem in constraint relaxation is the selection of the appr...
R. R. Bakker, F. Dikker, F. Tempelman, P. M. Wognu...
Entity matching is an important and difficult step for integrating web data. To reduce the typically high execution time for matching we investigate how we can perform entity matc...
Toralf Kirsten, Lars Kolb, Michael Hartung, Anika ...
Some of the most challenging applications to parallelize scalably are the ones that present a relatively small amount of computation per iteration. Multiple interacting performanc...
This paper introduces a new computer-aided classification system for detection of prostate cancer in Transrectal Ultrasound images (TRUS). To increase the efficiency of the comput...
Abstract. Traditional stochastic programming is risk neutral in the sense that it is concerned with the optimization of an expectation criterion. A common approach to addressing ri...