Zobrazeno 1 - 10
of 83
pro vyhledávání: '"bouhlel, Mohamed Salim"'
The amount of audio-visual information has increased dramatically with the advent of High Speed Internet. Furthermore, technological advances in recent years in the field of information technology, have simplified the use of video data in various fie
Externí odkaz:
http://arxiv.org/abs/1904.10715
Autor:
Mansouri, Ali, Bouhlel, Mohamed Salim
Several authors modelled networks ad hoc by oriented or disoriented graphs, whereby the problem of allowance (allocation) of the frequencies at the level of the network was transformed into coloring problem of nodes in the graph. Graph coloring is a
Externí odkaz:
http://arxiv.org/abs/1406.1329
Autor:
Mansouri, Ali, Bouhlel, Mohamed Salim
Publikováno v:
International Journal of Computer Science & Information Technology (IJCSIT) Vol 6, No 1, February 2014
A coloring of a graph G = (V,E) is a partition {V1, V2, . . ., Vk} of V into independent sets or color classes. A vertex v Vi is a Grundy vertex if it is adjacent to at least one vertex in each color class Vj . A coloring is a Grundy coloring if ever
Externí odkaz:
http://arxiv.org/abs/1406.0196
Autor:
Mansouri, Ali, bouhlel, Mohamed Salim
Publikováno v:
SETIT 2009 5th International Conference: Sciences of Electronic, Technologies of Information and T'elecommunications March 22 26 2009 TUNISIA
The problem of the data routing management, it provides a method or a strategy that guarantees at any time the connection between any pair of nodes in the network. This routing method must be able to cope with frequent changes in the topology and als
Externí odkaz:
http://arxiv.org/abs/1405.7383
Autor:
Mansouri, Ali, Bouhlel, Mohamed Salim
The Grundy number of a graph G is the maximum number k of colors used to color the vertices of G such that the coloring is proper and every vertex x colored with color i, is adjacent to (i - 1) vertices colored with each color j, In this paper we giv
Externí odkaz:
http://arxiv.org/abs/1405.6432
Autor:
Mansouri, Ali, Bouhlel, Mohamed Salim
Publikováno v:
Ubiquitous Computing and Communication Journal Special Issue for The International Conference on Computing, Communications and Information Technology Applications (CCITA-2010)
A Grundy k-coloring of a graph G, is a vertex k-coloring of G such that for each two colors i and j with i < j, every vertex of G colored by j has a neighbor with color i. The Grundy chromatic number (G), is the largest integer k for which there exis
Externí odkaz:
http://arxiv.org/abs/1405.6433
Autor:
Mansouri, Ali, bouhlel, Mohamed Salim
Publikováno v:
International Journal of Next-Generation Networks (IJNGN) Vol.5, No.4, December 2013
Our work becomes integrated into the general problem of the stability of the network ad hoc. Some, works attacked (affected) this problem. Among these works, we find the modelling of the network ad hoc in the form of a graph. We can resume the proble
Externí odkaz:
http://arxiv.org/abs/1401.7826
Autor:
Mansouri, Ali, Bouhlel, Mohamed Salim
Publikováno v:
International Journal of Next-Generation Networks (IJNGN) Vol.5, No.4, December 2013
Our work becomes integrated into the general problem of the stability of the network ad hoc. Some, works attacked this problem. Among these works, we find the modelling of the network ad hoc in the form of a graph. Thus the problem of stability of th
Externí odkaz:
http://arxiv.org/abs/1401.6936
Publikováno v:
IJCSI Volume 10, Issue 2,No 1, March 2013 , Pages 504-511
This paper presents a new progressive compression method for triangular meshes. This method, in fact, is based on a schema of irregular multi-resolution analysis and is centered on the optimization of the rate-distortion trade-off. The quantization p
Externí odkaz:
http://arxiv.org/abs/1309.3314
Publikováno v:
International Journal of Computing & Digital Systems; Feb2024, Vol. 15 Issue 1, p947-960, 14p
