Linear classifiers are much faster to learn and test than non-linear ones. On the other hand, non-linear kernels offer improved performance, albeit at the increased cost of training kernel classifiers. To use non-linear mappings with efficient linear learning algorithms, explicit embeddings that approximate popular kernels have recently been proposed. However, the embedding process is often cos...

Labeling of discrete Markov Random Fields (MRFs) has become an attractive approach for solving the problem of non-rigid image registration. Here, regularization plays an important role in order to obtain smooth deformations for the inherent ill-posed problem. Smoothness is achieved by penalizing the derivatives of the displacement field. However, efficient optimization strategies (based on iter...

The redshift-space correlation function ξs for projected galaxy separations <∼ 1h Mpc can be expressed as the convolution of the real-space correlation function with the galaxy pairwise velocity distribution function (PVDF). An exponential PVDF yields the best fit to the ξs measured from galaxy samples of different redshift surveys. We show that this exponential PVDF is not merely a fitting fun...

Recently, Boutonnet, Chifan, and Ioana proved that McDuff’s family of continuum many pairwise nonisomorphic separable II1 factors are in fact pairwise non-elementarily equivalent by proving that any ultrapowers of two distinct members of the family are nonsiomorphic. We use Ehrenfeucht-Fraisse games to provide an upper bound on the quantifier-depth of sentences which distinguish these theories.

We describe the algebraic properties of pairwise comparisons matrices with coefficients in an arbitrary group. We provide a vocabulary adapted for the description of main algebaric properties of inconsistency maps, describe an example where the use of a non abelian group is necessary, and decribe a generalization of pairwise comparisons matrices and inconsistency maps on a graph.