Search Results - "Hlaoui, A"
-
1
A new algorithm for inexact graph matching
Published in Object recognition supported by user interaction for service robots (2002)“…The graph is an essential data structure for representing relational information. When graphs are used to represent objects, comparing objects amounts to graph…”
Get full text
Conference Proceeding -
2
Prevalence of burnout among operating room professionals in the district of Sousse
Published in European journal of public health (01-09-2020)“…Abstract Background The Operating Room (OR) is a complex, stressful and potentially dangerous environment. In fact, the professionals practicing in these units…”
Get full text
Journal Article -
3
Median graph computation for graph clustering
Published in Soft computing (Berlin, Germany) (01-01-2006)“…In this paper, we are interested in the problem of graph clustering. We propose a new algorithm for computing the median of a set of graphs. The concept of…”
Get full text
Journal Article -
4
A graph clustering algorithm with applications to content-based image retrieval
Published in Proceedings of the 2003 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.03EX693) (2003)“…The graph is an important structure for representing objects and their relations. Its use in content-based image retrieval is still in its infancy, due to the…”
Get full text
Conference Proceeding -
5
Image retrieval using fuzzy segmentation and a graph matching technique
Published in Proceedings. International Conference on Machine Learning and Cybernetics (2002)“…We describe the design and implementation of a system for content-based image retrieval (CBIR). The system uses structural description by labelled graphs. When…”
Get full text
Conference Proceeding -
6
Using graph representation in content-based image retrieval
Published in ACS/IEEE International Conference on Computer Systems and Applications, 2003. Book of Abstracts (2003)“…Summary form only given. We propose a content-based image retrieval application using an inexact graph matching algorithm. The matching algorithm decomposes…”
Get full text
Conference Proceeding