F
Fatima K. Abu Salem
Researcher at American University of Beirut
Publications - 35
Citations - 212
Fatima K. Abu Salem is an academic researcher from American University of Beirut. The author has contributed to research in topics: Cache-oblivious algorithm & Cache. The author has an hindex of 6, co-authored 34 publications receiving 163 citations. Previous affiliations of Fatima K. Abu Salem include University of Oxford.
Papers
More filters
Proceedings ArticleDOI
FA-KES: A Fake News Dataset around the Syrian War
TL;DR: FA-KES, a fake news dataset around the Syrian war, is presented, which consists of news articles from several media outlets representing mobilisation press, loyalist press, and diverse print media and is ideal for training machine learning models to predict the credibility of news article.
Proceedings ArticleDOI
Factoring polynomials via polytopes
TL;DR: A new approach to multivariate polynomial factorisation is introduced which incorporates ideas from polyhedral geometry, and generalises Hensel lifting, and is able to exploit to some extent the sparsity of polynomials.
Journal ArticleDOI
Cadmium Health Risk Assessment and Anthropogenic Sources of Pollution in Mount-Lebanon Springs
Dana A. Halwani,Mey Jurdi,Fatima K. Abu Salem,Miran A. Jaffa,Nabil Amacha,Rima R. Habib,Hassan R. Dhaini +6 more
TL;DR: In this article, the authors conducted a health risk assessment for Cadmium and examined potential sources of pollution in springs of the Mount-Lebanon Governorate, a semi-urbanized area in Lebanon.
Posted Content
Fast Jacobian group operations for C_{3,4} curves over a large finite field
TL;DR: In this paper, fast addition algorithms for C 3, 4 curves of genus 3 have been proposed, which reduce to linear algebra in vector spaces of dimension O(g) once |K| >> g, and asymptotically require O (g 2.376) field operations using fast linear algebra.
Journal ArticleDOI
An efficient sparse adaptation of the polytope method over Fp and a record-high binary bivariate factorisation
TL;DR: This paper describes a sparse adaptation of the polytope method over finite fields with prime order, which requires fewer bit operations and memory references given a degree d sparse polynomial whose number of terms t satisfies t.