Well-structured transition systems provide the right foundation to compute a finite basis of the set of predecessors of the upward closure of a state. The dual problem, to compute...
Abstract. We show how polynomial path orders can be employed efficiently in conjunction with weak innermost dependency pairs to automatically certify the polynomial runtime comple...
A common approach in designing relational databases is to start with a universal relation schema, which is then decomposed into multiple subschemas. A good choice of subschemas ca...
: Many of ADAS applications such as pedestrian and vehicle detection are using stereo vision. By computing the well-known disparity the range of objects ahead of the car can be det...
: Negative information provides important additional knowledge that is not exploited for sensor data fusion tasks by default. This paper presents a new approach to incorporate such...