We present an algorithmic framework for producing Delaunay triangulations of manifolds. The input to the algorithm is a set of sample points together with coordinate patches indexed by those points. The transition functions between nearby coordinate patches are required to be bi-Lipschitz with a constant close to 1. The primary novelty of the framework is that it can accommodate abstract manifo...

In this paper, we propose word sense disambiguation methods based on lexical substitution and used for the task 1 of the SemDis2014 workshop. This methods are run by using short random walks on unipartite networks or bipartite networks. Some of these methods only use graphs automatically built from corpora (unsurpervised methods), others also use graphs built from handcraft resources filled by ...

Brute-force word sense disambiguation (WSD) algorithms based on semantic relatedness are really time consuming. We study how to perform WSD faster and better on the span of a text. Several stochastic algorithms can be used to perform Global WSD. We focus here on an Ant Colony Algorithm and compare it to two other methods (Genetic and Simulated Annealing Algorithms) in order to evaluate them on ...

— Let X be a Fano manifold with b2 = 1 different from the projective space such that any two surfaces in X have proportional fundamental classes in H4(X,C). Let f : Y → X be a surjective holomorphic map from a projective variety Y . We show that all deformations of f with Y and X fixed, come from automorphisms of X. The proof is obtained by studying the geometry of the integral varieties of the...