A k-triangulation of a convex polygon is a maximal set of diagonals so that no k + 1 of them mutually cross in their interiors. We present a bijection between 2-triangulations of a...
Abstract. The recovery of the mixture of an N-dimensional signal generated by N independent processes is a well studied problem (see e.g. [1,10]) and robust algorithms that solve t...
Harold W. Gutch, Takanori Maehara, Fabian J. Theis
In this article we present Supervised Semantic Indexing (SSI) which defines a class of nonlinear (quadratic) models that are discriminatively trained to directly map from the word...
Bing Bai, Jason Weston, David Grangier, Ronan Coll...
: Experimental and theoretical specific optical rotations (OR) of anhydro, epithio, and epiminoderivatives of methyl tetrofuranosides in chloroform solutions have been compared an...
We continue our recent work on finite-sample, i.e., non-asymptotic, inference with two-step, monotone incomplete data from Nd(µ, Σ), a multivariate normal population with mean ...