Dynamic detection of likely invariants is a program analysis that generalizes over observed values to hypothesize program properties. The reported program properties are a set of ...
We present a computational framework to automatically discover high-order temporal social patterns from very noisy and sparse location data. We introduce the concept of social foo...
We present an unusual algorithm involving classification trees-CARTwheels--where two trees are grown in opposite directions so that they are joined at their leaves. This approach ...
Abstract There is an intimate link between program structure and behaviour. Exploiting this link to phrase program correctness problems in terms of the structural properties of a p...
Abstract. In moving object databases, many authors assume that number and position of objects to be processed are always known in advance. Detecting an unknown moving object and pu...