Zobrazeno 1 - 10
of 30
pro vyhledávání: '"Anis Uddin"'
Autor:
Mehmet Salih Yıldırım, Nur Ahmad Rudin, Abraham Tanimowo, Yakup Sarpdağı, Kumaran Gengatharan, Urushi Maggoon, Ram Bahadur Khadka, Apurba Gohain, Andrianirina Rhino, Muhammet Ali Aydın, Muhammad Tayyeb, Anis Uddin, Sweta Majumder, Güray Okyar, Metin Yıldız, Debopriya Ghatak
Publikováno v:
Turkish Journal of Internal Medicine, Vol 3, Iss 3, Pp 85-94 (2021)
Objectives: This research was conducted to determining the health literacy levels and attitudes of ındividuals in different countries towards vaccination Material and Methods: This study is cross-sectional, comprised of eight hundred and and thirty
Externí odkaz:
https://doaj.org/article/fb4e073796b54b869499a115b828af45
Autor:
Metin Yıldız, Abraham Tanimowo, Marco Monti, Mehmet Salih Yıldırım, Ram Bahadur Khadka, Asma Hasan Sbaih, Çiğdem Müge Haylı, Muhammad Tayyeb, Sweta Majumder, Anis Uddin, Tajudeen Oluwafemi Noibi, Güray Okyar
Publikováno v:
Ķazaķstannyṇ Klinikalyķ Medicinasy, Vol 18, Iss 2, Pp 8-13 (2021)
Objective: This descriptive cross-sectional survey determined the individuals' coronavirus disease knowledge levels in eleven countries. Material and Methods: This cross-sectional study was conducted with one thousand forty-three (n= 1043) individual
Externí odkaz:
https://doaj.org/article/1b165cb166ae48f9ad629b180bc615b8
Autor:
Aslay, Cigdem, Nasir, Muhammad Anis Uddin, Morales, Gianmarco De Francisci, Gionis, Aristides
Given a labeled graph, the frequent-subgraph mining (FSM) problem asks to find all the $k$-vertex subgraphs that appear with frequency greater than a given threshold. FSM has numerous applications ranging from biology to network science, as it provid
Externí odkaz:
http://arxiv.org/abs/1809.00394
Autor:
Nasir, Muhammad Anis Uddin, Horii, Hiroshi, Serafini, Marco, Kourtellis, Nicolas, Raymond, Rudy, Girdzijauskas, Sarunas, Osogami, Takayuki
Streaming applications frequently encounter skewed workloads and execute on heterogeneous clusters. Optimal resource utilization in such adverse conditions becomes a challenge, as it requires inferring the resource capacities and input distribution a
Externí odkaz:
http://arxiv.org/abs/1705.09073
Autor:
Nasir, Muhammad Anis Uddin, Gionis, Aristides, Morales, Gianmarco De Francisci, Girdzijauskas, Sarunas
Given a large graph, the densest-subgraph problem asks to find a subgraph with maximum average degree. When considering the top-$k$ version of this problem, a na\"ive solution is to iteratively find the densest subgraph and remove it in each iteratio
Externí odkaz:
http://arxiv.org/abs/1610.05897
Autor:
Nasir, Muhammad Anis Uddin
Distributed Stream Processing Engines (DSPEs) target applications related to continuous computation, online machine learning and real-time query processing. DSPEs operate on high volume of data by applying lightweight operations on real-time and cont
Externí odkaz:
http://arxiv.org/abs/1605.00928
Autor:
Nasir, Muhammad Anis Uddin, Morales, Gianmarco De Francisci, Garcia-Soriano, David, Kourtellis, Nicolas, Serafini, Marco
We study the problem of load balancing in distributed stream processing engines, which is exacerbated in the presence of skew. We introduce Partial Key Grouping (PKG), a new stream partitioning scheme that adapts the classical "power of two choices"
Externí odkaz:
http://arxiv.org/abs/1510.07623
Autor:
Nasir, Muhammad Anis Uddin, Morales, Gianmarco De Francisci, Kourtellis, Nicolas, Serafini, Marco
Carefully balancing load in distributed stream processing systems has a fundamental impact on execution latency and throughput. Load balancing is challenging because real-world workloads are skewed: some tuples in the stream are associated to keys wh
Externí odkaz:
http://arxiv.org/abs/1510.05714
Many decentralized online social networks (DOSNs) have been proposed due to an increase in awareness related to privacy and scalability issues in centralized social networks. Such decentralized networks transfer processing and storage functionalities
Externí odkaz:
http://arxiv.org/abs/1508.05591
Autor:
Nasir, Muhammad Anis Uddin, Morales, Gianmarco De Francisci, García-Soriano, David, Kourtellis, Nicolas, Serafini, Marco
We study the problem of load balancing in distributed stream processing engines, which is exacerbated in the presence of skew. We introduce Partial Key Grouping (PKG), a new stream partitioning scheme that adapts the classical "power of two choices"
Externí odkaz:
http://arxiv.org/abs/1504.00788