In this paper, we consider the recognition problem on two classes of perfectly orderable graphs, namely, the HHD-free and the Welsh-Powell opposition graphs (or WPO-graphs). In par...
Abstract. The paper describes a fast system for appearance based image recognition . It uses local invariant descriptors and efficient nearest neighbor search. First, local affine ...
: The World-Wide-Web contains data that cannot be constrained by a schema. Another source for such data is heterogenous corporate systems which are integrated in order to get bette...
A large proportion of the massive amounts of data that are being collected by many organisations today is about people, and often contains identifying information like names, addre...
One of the fundamental problems with the static analysis of binary (executable) code is that7 of recognizing, in a machine-independent way, the target addresses of n-conditional b...