.

Recently added

LAUR Repository

School of Arts and Sciences: Recent submissions

  • On the parameterized parallel complexity and the vertex cover problem 
    Abu-Khzam, Faisal N.; Li, Shouwei; Markarian, Chrisitne; Meyer auf der Heide, Friedhelm; Podipyan, PAvel (Springer, )
    Efficiently parallelizable parameterized problems have been classified as being either in the class FPP (fixed-parameter parallelizable) or the class PNC (parameterized analog of NC), which contains FPP as a subclass. In ...
  • Scalable parallel algorithms for difficult combinatorial problems 
    Abu-Khzam, Faisal N.; Langston, Micheal A.; Shanbhag, Pushkar
    A novel combination of emergent algorithmic methods, powerful computational platforms and supporting infrastructure is described. These complementary tools and technologies are used to launch systematic attacks on combinatorial ...
  • On the relative efficiency of maximal clique enumeration algorithms, with application to high-throughput computational biology 
    Abu-Khzam, Faisal N.; Baldwin, Nicole E.; Langston, Micheal A.; Samatova, Nagiza F.
    The efficient enumeration of maximal cliques has applications in microarray analysis and a number of other foundational problems of computational biology. In this paper, we analyze and test existing maximal clique enumeration ...
  • Grid computing 
    Abu-Khzam, Faisal N.; Langston, Micheal A. (ACM, )
  • Distributed dimension reduction algorithms for widely dispersed data 
    Abu-Khzam, F.N.; Samatova, N.F.; Ostrouchov, G.; Langston, M.A.; Al Geist, G.
    It is well known that information retrieval, clustering and visualization can often be improved by reducing the dimensionality of high dimensional data. Classical techniques offer optimality but are much too slow for ...
  • A ratio Tauberian theorem 
    Abu-Khzam, Faisal N. (Amercian University of Beirut, )
    Let f be a given function and Tf some integral transform of it. The question of deducing the asymptotic behavior of - from that of Tf is classical and has received much attention. More recently the question of deducing the ...
  • Topics in graph algorithms 
    Abu-Khzam, Faisal Nabih (University of Tennessee, )
    Coping with computational intractability has inspired the development of a variety of algorithmic techniques. The main challenge has usually been the design of polynomial time algorithms for NP-complete problems in a way ...
  • Clustering with lower-bounded sizes 
    Abu-Khzam, Faisal N.; Bazgan, Cristina; Casel, Katrin; Fernau, Henning
    Classical clustering problems search for a partition of objects into a fixed number of clusters. In many scenarios, however, the number of clusters is not known or necessarily fixed. Further, clusters are sometimes only ...
  • Turbo-charging dominating set with an FPT subroutine 
    Abu-Khzam, Faisal N.; Cai, Shaowei; Egan, Judith; Shaw, Peter; Wang, Kai (Springer, )
    Turbo-charging is a recent algorithmic technique that is based on the fixed-parameter tractability of the dynamic versions of some problems as a way to improve heuristics. We demonstrate the effectiveness of this technique ...
  • Approximation and heuristic algorithms for computing backbones in asymmetric ad-hoc networks 
    Abu-Khzam, Faisal N.; Markarian, Christine; Schubert, Micheal; Meyer auf der Heide, Friedhelm
    We consider the problem of dominating set-based virtual backbone used for routing in asymmetric wireless ad-hoc networks. These networks have non-uniform transmission ranges and are modeled using directed disk graphs. The ...
  • Modular-width 
    Abu-Khzam, Faisal N.; Markarian, Christine; Podipyan, Pavel (Springer, )
    Many graph problems such as maximum cut, chromatic number, hamiltonian cycle, and edge dominating set are known to be fixed-parameter tractable (FPT) when parameterized by the treewidth of the input graphs, but become ...
  • Untitled 
    Abu-Khzam, Faisal N.; Jahed, Karim A.; Mouawad, Amer E.
    Many exact search algorithms for NP-hard graph problems adopt the old Davis-Putman branch-and-reduce paradigm. The performance of these algorithms often suffers from the increasing number of graph modifications, such as ...
  • On the complexity of multi-parameterized cluster editing 
    Abu-Khzam, Faisal
    The Cluster Editing problem seeks a transformation of a given undirected graph into a disjoint union of cliques via a minimum number of edge additions or deletions. A multi-parameterized version of the problem is studied, ...
  • Building clusters with lower-bounded sizes 
    Abu-Khzam, Faisal; Casel, Katrin; Fernau, Henning; Bagzan, Cristina
    Classical clustering problems search for a partition of objects into a fixed number of clusters. In many scenarios however the number of clusters is not known or necessarily fixed. Further, clusters are sometimes only ...
  • Contemporary stylistics 
    SAS; 200603435; English; Badran, Dany; dany.badran@lau.edu.lb; Lebanese American University
  • Ideology 
    Badran, D.
  • Supporting Emirati females leadership skills through teaching them how to debate 
    Badran, Dany; Rapanta, Chrysi
    In response to the emerging need in the United Arab Emirates to empower young women and prepare them for future leadership tasks, a debate teaching intervention was organized in two phases at a public University in Dubai. ...
  • Metaphor as argument 
    Badran, Dany
    One of the most intriguing questions in both stylistic and rhetorical analyses relates to determining textual effect on readers, aesthetic or otherwise. Whether the power of the text is directly associated with the role ...
  • Ideology through modality in discourse analysis 
    Badran, Dany (University of Nottingham, )
    This study is broadly concerned with the analysis of ideology in discourse. More specifically, it investigates the role modality plays in reflecting underlying ideologies as well as ideological inconsistencies in three ...
  • Quality estimation models optimization using genetic algorithms: Case of maintainability 
    Azar, D.; Sahraoui, D.H.A.

Search LAUR


Advanced Search

Browse

My Account