Paulin Melatagia

Paulin Melatagia
University of Yaoundé I | UY1 · Faculty of Sciences

PhD

About

11
Publications
1,219
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
25
Citations
Additional affiliations
January 2010 - present
University of Yaoundé I
Position
  • Lecturer

Publications

Publications (11)
Article
Full-text available
International audience Named Entity Recognition (NER) is a fundamental task in many NLP applications that seek to identify and classify expressions such as people, location, and organization names. Many NER systems have been developed, but the annotated data needed for good performances are not available for low-resource languages, such as Cameroon...
Preprint
Full-text available
Named entity recognition is an important task in natural language processing. It is very well studied for rich language, but still under explored for low-resource languages. The main reason is that the existing techniques required a lot of annotated data to reach good performance. Recently, a new distributional representation of words has been prop...
Conference Paper
Named Entity Recognition (NER) is a fundamental task in many NLP applications that seek to identify and classify expressions such as people, location, and organization names. Many NER systems have been developed, but the annotated data needed for learning is not available for low-resource languages, such as Cameroonian languages. In this paper we e...
Conference Paper
Neural networks are gaining popularity in software engineering. This paper presents a dedicated API and visual environment to train and use a neural networks on software source code related data. This short paper illustrates the API using two examples involving prediction of source code properties.
Article
Full-text available
We propose a model of growing networks based on cliques formations. A clique is used to illustrate for example co-authorship in co-publication networks, co-occurence of words or collaboration between actors of the same movie. Our model is iterative and at each step, a clique of λη existing vertices and (1 − λ)η new vertices is created and added in...
Article
We present an online algorithm for routing the automorphisms (BPC permutations) of the queueless MIMD hypercube. The routing algorithm has the virtue of being executed by each node of the hypercube without knowing the state of the others nodes. The algorithm is also vertex and link-contention free. We show, using the proposed algorithm, that BPC pe...
Article
In this paper, we study the convergence of a mathematical model of opinion dynamics called the majority model. In this model, at each iteration step, each individual adopts the opinion which exerts on him the maximum social pressure. Under some assumptions on interaction among members of the society, we show that, in parallel mode, attractors of th...
Article
Given an undirected and connected graph G, with a non-negative weight on each edge, the Minimum Average Distance (MAD) spanning tree problem is to find a spanning tree of G which minimizes the average distance between pairs of vertices. This network design problem is known to be NP-hard even when the edge-weights are equal. In this paper we make a...
Article
Full-text available
In this paper, we study memory iteration where the updating considers a longer history of each site and the set of interaction matrices is quasi-palindromic. For parallel and sequential iterations with memory, we define Lyapunov functional which permits us to characterize the periods behaviour and explicitly bounds the transient lengths of quasi-pa...
Article
Full-text available
We study memory iteration where the updating consider a longer history of each site and the set of interaction matrices is palindromic. We analyze two different ways of updating the net-works: parallel iteration with memory and sequential iteration with memory that we introduce in this paper. For parallel iteration, we define Lyapunov functional wh...

Network

Cited By