Výsledky vyhledávání - "Younes Guellouma"

Akademický článek

Efficient Implementation for Deterministic Finite Tree Automata Minimization

Publikováno v: Journal of Computing and Information Technology, Vol 24, Iss 4, Pp 311-322 (2016)

We address the problem of deterministic finite tree automata (DFTA) minimization. We describe a new alternative to implement both standard and incremental tree automata minimization using a well-defined graph representing the automaton to be minimize

Externí odkaz: https://doaj.org/article/d834d45a585c42eb8d4185a77f4dbfe1

Zobrazit plný text záznamu

Incremental tree-based successive POI recommendation in location-based social networks

Autor: Hanane Amirat, Nasreddine Lagraa, Philippe Fournier-Viger, Youcef Ouinten, Mohammed Lamine Kherfi, Younes Guellouma

Publikováno v: Applied Intelligence. 53:7562-7598

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::2ad4523bebcf77ea0ded34a334207d63
https://doi.org/10.1007/s10489-022-03842-4

Zobrazit plný text záznamu

Analysis of Congestion Control Mechanisms for Cooperative Awareness in IoV Environments

Autor: Lakhdar Kamel Ouladdjedid, Carlos Tavares Calafate, Chaker Abdelaziz Kerrache, Younes Guellouma

Publikováno v: Electronics
Volume 12
Issue 3
Pages: 512

Traditional vehicle ad hoc networks (VANETs) have evolved toward the Internet of Vehicles (IoV) during the past ten years with the introduction of 5G communication technology and the growing number of vehicles linked to the Internet. The coexistence

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c5e11948de84a2777847979c697d7400

Zobrazit plný text záznamu

From Tree Automata to Rational Tree Expressions

Autor: Hadda Cherroun, Younes Guellouma

Publikováno v: International Journal of Foundations of Computer Science. 29:1045-1062

We propose a construction of rational tree expression from finite tree automata. First, we define rational expression equation systems and we propose a substitution based method to find the unique solution. Furthermore, we discuss the case of recursi

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::0daf2293838a598fff36262155638316
https://doi.org/10.1142/s012905411850020x

Zobrazit plný text záznamu

From Tree Automata to String Automata Minimization

Autor: Djelloul Ziadi, Bruce W. Watson, Younes Guellouma, Hadda Cherroun

Publikováno v: Theory of Computing Systems. 62:1203-1222

In this paper, we propose a reduction of the minimization problem for a bottom-up deterministic tree automaton (DFTA), making the latter a minimization of a string deterministic finite automaton (DFA). To achieve this purpose, we proceed first by the

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::8ca9faca56c11cdc0297977857b4a526
https://doi.org/10.1007/s00224-017-9815-4

Zobrazit plný text záznamu

Efficient Implementation for Deterministic Finite Tree Automata Minimization

Autor: Hadda Cherroun, Younes Guellouma

Publikováno v: Journal of computing and information technology
Volume 24
Issue 4
Journal of Computing and Information Technology, Vol 24, Iss 4, Pp 311-322 (2016)

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fd347312788af7a68954cc94796f4e96
https://hrcak.srce.hr/file/255304

Zobrazit plný text záznamu

An efficient stemming for Arabic Text Classification

Autor: Hadda Cherroun, Djelloul Ziadi, Younes Guellouma, Attia Nehar

Publikováno v: 2012 International Conference on Innovations in Information Technology (IIT).

Using N-gram technique without stemming is not appropriate in the context of Arabic Text Classification. For this, we introduce a new stemming technique, which we call “approximate-stemming”, based on the use of Arabic patterns. These are modeled

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::a71e0966c6e983b380128863b5b0f3bb
https://doi.org/10.1109/innovations.2012.6207760

Zobrazit plný text záznamu

A fast implementation of incremental minimization of tree automata

Autor: Djelloul Ziadi, Attia Nehar, Younes Guellouma, Hadda Cherroun

Publikováno v: 2012 International Conference on Innovations in Information Technology (IIT).

We address the problem of minimizing tree automata especially its incremental version. Unlike the classical minimization, incremental version [1] computes equivalences between states in the safe way, like that the algorithm may be halted at any momen

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::4d3cf41ff88bf4eccc7859daca9c32fa
https://doi.org/10.1109/innovations.2012.6207759

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání