Search

Your search keyword '"HADDAD, MOHAMMED"' showing total 352 results
Start Over Author "HADDAD, MOHAMMED"

Refine your results

more »

more »

more »

more »
352 results on '"HADDAD, MOHAMMED"'

153. Word Spotting Based on Bispace Similarity for Visual Information Retrieval in Handwritten Document Images

Author

Haddad, Mohammed, Benabdelaziz, Ryma, and Gaceb, Djamel

Abstract

Retrieving information from a huge collection of ancient handwritten documents is important for indexing, interpreting, browsing, and searching documents in various domains. Word spotting approaches are widely used in this context but have several limitations related to the complex properties of handwriting. These can appear at several steps: interest point detection, description, and matching. This article proposes a new word spotting approach for the word retrieval in handwritten document, which mainly leverages the properties of image gradients for visual features detection and description. The proposed approach is based on the combination of spatial relationships with textural information to design a more accurate matching. The experimental results of the proposed approach demonstrate a higher performance over the Jeremy Bentham dataset, evaluated following the recent benchmarks of ICDAR 2015 Competition on Keyword Spotting for Handwritten Documents.

Published
2019
Full Text
View/download PDF

154. Dominated coloring of graphs

Author

Boumediene Merouane, Hocine, Haddad, Mohammed, Chellali, Mustapha, Kheddouci, Hamamache, Graphes, Algorithmes et Multi-Agents (GrAMA), Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École Centrale de Lyon (ECL), Université de Lyon-Université Lumière - Lyon 2 (UL2)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Université Lumière - Lyon 2 (UL2), and SI LIRIS, Équipe gestionnaire des publications

Subjects
[INFO]Computer Science [cs], [INFO] Computer Science [cs]
Abstract

International audience; In this paper, we introduce and study a new coloring prob- lem of a graph called the Dominated coloring (short Domcoloring). A Domcoloring of a graph G is a vertex proper coloring of G such that each color class is dominated by at least one vertex of G. The minimum number of colors among all Domcolorings is called dominated chromatic (short Domchromatic) number, denoted by χdom(G). In this paper we prove the NP-completeness of the problem and give some bounds and exact values for the Domchromatic number for some graph classes.

Published
2012

156. GraphExploiter

Author

Lequay, Victor, primary, Ringot, Alexis, additional, Haddad, Mohammed, additional, Effantin, Brice, additional, and Kheddouci, Hamamache, additional

Published
2015
Full Text
View/download PDF

158. Endoscopic ultrasound-guided liver biopsy: a multicenter experience

Author

Diehl, David, additional, Johal, Amitpal, additional, Khara, Harshit, additional, Stavropoulos, Stavros, additional, Al-Haddad, Mohammed, additional, Ramesh, Jayapal, additional, Varadarajulu, Shyam, additional, Aslanian, Harry, additional, Gordon, Stuart, additional, Shieh, Frederick, additional, Pineda-Bonilla, Jonh, additional, Dunkelberger, Theresa, additional, Gondim, Dibson, additional, and Chen, Eric, additional

Published
2015
Full Text
View/download PDF

159. A survey on graph based service discovery approaches for ad hoc networks

Author

Haddad, Mohammed, Kheddouci, Hamamache, Laboratoire d'Informatique pour l'Entreprise et les Systèmes de Production (LIESP), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université Lumière - Lyon 2 (UL2)-École Centrale de Lyon (ECL), Université de Lyon, and Equipe, Graphe Liesp

Subjects
[INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], [INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI], topologies virtuelles dynamiques, réseaux ad hoc, Découverte de services, ComputingMilieux_MISCELLANEOUS
Abstract

International audience

Published
2007

160. A Virtual dynamic topology for service discovery in mobile ad hoc networks

Author

Haddad, Mohammed, Kheddouci, Hamamache, Equipe, Graphe Liesp, Laboratoire d'Informatique pour l'Entreprise et les Systèmes de Production (LIESP), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université Lumière - Lyon 2 (UL2)-École Centrale de Lyon (ECL), and Université de Lyon

Subjects
[INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], [INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI], ComputingMilieux_MISCELLANEOUS
Abstract

International audience

Published
2007

161. Découverte de services dans les réseaux ad hoc

Author

Haddad, Mohammed, Kheddouci, Hamamache, Equipe, Graphe Liesp, Laboratoire d'Informatique pour l'Entreprise et les Systèmes de Production (LIESP), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université Lumière - Lyon 2 (UL2)-École Centrale de Lyon (ECL), and Université de Lyon

Subjects
[INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], [INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI], ComputingMilieux_MISCELLANEOUS
Abstract

National audience

Published
2006

162. Topologie virtuelle pour la découverte de service dans les réseaux ad hoc

Author

Haddad, Mohammed, Kheddouci, Hamamache, Equipe, Graphe Liesp, Laboratoire d'Informatique pour l'Entreprise et les Systèmes de Production (LIESP), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université Lumière - Lyon 2 (UL2)-École Centrale de Lyon (ECL), and Université de Lyon

Subjects
[INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], [INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI], ComputingMilieux_MISCELLANEOUS
Abstract

National audience

Published
2006

163. Service discovery in ad hoc networks

Author

Haddad, Mohammed, Kheddouci, Hamamache, Equipe, Graphe Liesp, Laboratoire d'Informatique pour l'Entreprise et les Systèmes de Production (LIESP), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université Lumière - Lyon 2 (UL2)-École Centrale de Lyon (ECL), and Université de Lyon

Subjects
[INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], [INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI], ComputingMilieux_MISCELLANEOUS
Abstract

International audience

Published
2006

164. A O( m) Self-Stabilizing Algorithm for Maximal Triangle Partition of General Graphs.

Author

Neggazi, Brahim, Turau, Volker, Haddad, Mohammed, and Kheddouci, Hamamache

Subjects
SELF-stabilization (Computer science), COMPUTER algorithms, PARALLEL algorithms, COMPUTER science, PARALLEL computers
Abstract

The triangle partition problem is a generalization of the well-known graph matching problem consisting of finding the maximum number of independent edges in a given graph, i.e., edges with no common node. Triangle partition instead aims to find the maximum number of disjoint triangles. The triangle partition problem is known to be NP-complete. Thus, in this paper, the focus is on the local maximization variant, called maximal triangle partition (MTP). Thus, paper presents a new self-stabilizing algorithm for MTP that converges in O( m) moves under the unfair distributed daemon. [ABSTRACT FROM AUTHOR]

Published
2017
Full Text
View/download PDF

173. MAQSA

Author

Amer-Yahia, Sihem, primary, Anjum, Samreen, additional, Ghenai, Amira, additional, Siddique, Aysha, additional, Abbar, Sofiane, additional, Madden, Sam, additional, Marcus, Adam, additional, and El-Haddad, Mohammed, additional

Published
2012
Full Text
View/download PDF

180. A Formal Model for Space Based Ubiquitous Computing

Author

Dooley, James, primary, Henson, Martin, additional, Callaghan, Vic, additional, Hagras, Hani, additional, Al-Ghazzawi, Daniyal, additional, Malibari, Areej, additional, Al-Haddad, Mohammed, additional, and Al-Ghamdi, Abdullah Al-Malaise, additional

Published
2011
Full Text
View/download PDF

196. Decomposition of Complete Multigraphs Into Stars and Cycles

Author

Beggas, Fairouz, Haddad, Mohammed, and Kheddouci, Hamamache

Abstract

Let k be a positive integer, Skand Ckdenote, respectively, a star and a cycle of k edges. λKnis the usual notation for the complete multigraph on n vertices and in which every edge is taken λ times. In this paper, we investigate necessary and sufficient conditions for the existence of the decomposition of λKninto edges disjoint of stars Sk’s and cycles Ck’s.

Published
2015
Full Text
View/download PDF

197. Efficient distributed lifetime optimization algorithm for sensor networks.

Author

Bahi, Jacques, Haddad, Mohammed, Hakem, Mourad, and Kheddouci, Hamamache

Subjects
MATHEMATICAL optimization, COMPUTER algorithms, WIRELESS sensor networks, QUALITY of service, APPLICATION software, COMPUTER reliability
Abstract

Abstract: One of the main design challenges in Wireless Sensor Networks (WSN) is to prolong the system lifetime, while achieving acceptable quality of service for applications. In WSN, each sensor node is battery powered and it is not convenient to recharge or replace the batteries in many cases, especially in remote and hostile environments. Due to the limited capabilities of sensor nodes, it is usually desirable that a WSN should be deployed with high density and thus redundancy can be exploited to increase the network’s lifetime. In this paper, we introduce an efficient lifetime optimization and self-stabilizing algorithm to enhance the lifetime of wireless sensor networks especially when the reliabilities of sensor nodes are expected to decrease due to use and wear-out effects. Our algorithm seeks to build resiliency by maintaining a necessary set of working nodes and replacing failed ones when needed. We provide some theoretical and simulation results, that fully demonstrate the usefulness of the proposed algorithm. [Copyright &y& Elsevier]

Published
2014
Full Text
View/download PDF

198. An Efficient Pancreatic Cyst Identification Methodology Using Natural Language Processing.

Author

Mehrabi, Saeed, Schmidt, C. Max, Waters, Joshua A., Beesley, Chris, Krishnan, Anand, Kesterson, Joe, Dexter, Paul, Al-Haddad, Mohammed A., Tierney, William M., and Palakal, Mathew

Abstract

Pancreatic cancer is one of the deadliest cancers, mostly diagnosed at late stages. Patients with pancreatic cysts are at higher risk of developing cancer and their surveillance can help to diagnose the disease in earlier stages. In this retrospective study we collected a corpus of 1064 records from 44 patients at Indiana University Hospital from 1990 to 2012. A Natural Language Processing (NLP) system was developed and used to identify patients with pancreatic cysts. NegEx algorithm was used initially to identify the negation status of concepts that resulted in precision and recall of 98.9% and 89% respectively. Stanford Dependency parser (SDP) was then used to improve the NegEx performance resulting in precision of 98.9% and recall of 95.7%. Features related to pancreatic cysts were also extracted from patient medical records using regex and NegEx algorithm with 98.5% precision and 97.43% recall. SDP improved the NegEx algorithm by increasing the recall to 98.12%. [ABSTRACT FROM AUTHOR]

Published
2013
Full Text
View/download PDF

200. Recognizing the critically ill patient.

Author

Robertson, Laura C. and Al-Haddad, Mohammed

Subjects
CATASTROPHIC illness, MEDICAL records, VITAL signs, MEDICAL needs assessment, CRITICALLY ill, ADVERSE health care events, SYMPTOMS, PATIENTS
Abstract

Abstract: Critical illness is a life-threatening multisystem process that can result in significant morbidity or mortality. In most patients, critical illness is preceded by a period of physiological deterioration; but evidence suggests that the early signs of this are frequently missed. All clinical staff have an important role to play in implementing an effective ‘Chain of Response’ that includes accurate recording and documentation of vital signs, recognition and interpretation of abnormal values, patient assessment and appropriate intervention. Early-warning systems are an important part of this and can help identify patients at risk of deterioration and serious adverse events. Assessment of the critically ill patient should be undertaken by an appropriately trained clinician and follow a structured ABCDE (airway, breathing, circulation, disability and exposure) format. This facilitates correction of life-threatening problems by priority and provides a standardized approach between professionals. Good outcomes rely on rapid identification, diagnosis and definitive treatment and all doctors should possess the skills to recognize the critically ill patient and instigate appropriate initial management. [Copyright &y& Elsevier]

Published
2013
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results