We study the Cost-Per-Action or Cost-Per-Acquisition (CPA) charging scheme in online advertising. In this scheme, instead of paying per click, the advertisers pay only when a user...
Computational vision algorithms are often developed in a Bayesian framework. Two estimators are commonly used: maximum a posteriori (MAP), and minimum mean squared error (MMSE). W...
We present a novel variational and statistical approach for shape registration. Shapes of interest are implicitly embedded in a higher dimensional space of distance transforms. In...
Xiaolei Huang, Nikos Paragios, Dimitris N. Metaxas
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
In this paper we introduce an application of real-coded genetic algorithms to the problem of consistent graph layout and exploring the role of mutation for this particular problem...