Výsledky vyhledávání - "Partitionnement"

Data-Driven Malware Classification Assisted by Machine Learning Methods

Autor: Puodzius, Cassius

Publikováno v: Cryptography and Security [cs.CR]. Inria Rennes, 2022. English. ⟨NNT : ⟩
Cryptography and Security [cs.CR]. Université de Rennes I, 2022. English. ⟨NNT : ⟩
Other [cs.OH]. Université de Rennes, 2022. English. ⟨NNT : 2022REN1S090⟩

Historically, malware (MW) analysis has heavily resorted to human savvy for manual signature creation to detect and classify MW. This procedure is very costly and time consuming, thus unable to cope with modern cyber threat scenario. The solution is

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::0c70dd913c00e376078eb004b886fa01
https://hal.inria.fr/tel-03935152/document

Zobrazit plný text záznamu

Algorithme d’ordonnancement optimal basé sur la programmation dynamique pour les applications aux données parallèles sur des plates-formes hétérogènes

Autor: Lima Pilla, Laércio

Publikováno v: [Research Report] RR-9487, CNRS; LaBRI; Inria; Université de Bordeaux; Bordeaux INP. 2022, pp.1-6

This report discusses a new algorithm for makespan minimization on situations where the workload can be partitioned among heterogeneous resources. Without making any assumptions regarding the behavior or shape of the functions giving the execution ti

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od_______165::6633e618282866888615c81bca6240db
https://inria.hal.science/hal-03776372v2/document

Zobrazit plný text záznamu

Mapping Tree-shaped Workflows on Memory-heterogeneous Architectures

Autor: Kulagina, Svetlana, Meyerhenke, Henning, Benoit, Anne

Publikováno v: 20th Int. Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Platforms (HeteroPar)
20th Int. Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Platforms (HeteroPar), Aug 2022, Glasgow, United Kingdom
[Research Report] RR-9458, Inria Grenoble Rhône-Alpes. 2022, pp.1-20

Directed acyclic graphs are commonly used to model scientific workflows, by expressing dependencies between tasks, as well as the resource requirements of the workflow. As a special case, rooted directed trees occur in several applications, for insta

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::420411229e1a3dd6530d229280e016ea
https://inria.hal.science/hal-03921445

Zobrazit plný text záznamu

Ordonnancement des données d'entrée sortie à l'échelle

Autor: Vidal, Nicolas

Publikováno v: Data Structures and Algorithms [cs.DS]. Université de Bordeaux, 2022. English. ⟨NNT : 2022BORD0026⟩

In high performance computing, platforms (the supercomputers) are composed of computational resources divided into racks. Each rack have one (sometimes several) I/O nodes to access the parallel file system (PFS). Following the growth and the optimiza

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od_______165::8b16e5b2bf3a544e8a6de6e3497b2867
https://theses.hal.science/tel-03892821/document

Zobrazit plný text záznamu

Quantum algorithms for hypergraph bi-partitioning

Autor: Rodriguez, Julien

Publikováno v: ROADEF 2022-23ème congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision
ROADEF 2022-23ème congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, INSA Lyon, Feb 2022, Lyon, France

International audience; The arrival of quantum machines may revolutionize many fields, in particular that of combinatorial algorithms. Indeed, these machines propose several optimization algorithms, such as QAOA for "Quantum Approximate Optimization

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::ded0de16173d45397ba0767a218547c1
https://hal.archives-ouvertes.fr/hal-03595234

Zobrazit plný text záznamu

Apprentissage non supervisé pour données extrêmement volumineuses en situation de ressources informatiques arbitrairement limitées

Autor: Antonazzo, Filippo

Publikováno v: Data Structures and Algorithms [cs.DS]. Université de Lille, 2022. English. ⟨NNT : 2022ULILB015⟩
Statistics [math.ST]. Université de Lille, 2022. English. ⟨NNT : ⟩

Clustering reveals all its interest when the data set size considerably increases, since there is the opportunity to discover tiny but possibly high value clusters, which can not be detected with moderate sample sizes. However, the clustering of such

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::3fe75bf7693d2ff1066ed2d94bec5b7a
https://theses.hal.science/tel-03846222

Zobrazit plný text záznamu

Solutions parallèles sur le modèle CGM pour une classe de problèmes de programmation dynamique de type polyadique non-serial

Autor: LACMOU ZEUTOUO, Jerry

We are interested in the parallelization of a class of non-serial polyadic dynamic-programming problems in this thesis. These problems are characterized by a strong dependency between subproblems. To design efficient and portable parallel solutions t

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od_______166::005d50aae26caa61ba18bc3e7180b681
https://hal.science/tel-03936771

Zobrazit plný text záznamu

Partitionnement d'un ensemble connexe d'hypergraphes orientés sans cycle avec minimisation de chemin

Autor: Rodriguez, Julien, Galea, François, Pellegrini, François, Zaourar, Lilia

Publikováno v: 23ème congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision
23ème congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, INSA Lyon, Feb 2022, Villeurbanne-Lyon, France

International audience; Un hypergraphe est une extension de la notion de graphe dans lequel les hyperarêtes contiennent au moins un sommet. Les hypergraphes modélisent de nombreux objets comme par exemple, un circuit électronique, un ensemble de d

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::e632aa2d603a8a3fca7e674c97d0021f
https://hal.archives-ouvertes.fr/hal-03596218

Zobrazit plný text záznamu

Modélisation des inondations historiques de la Sarre

Autor: Hariri, Sleimane

Publikováno v: Fluid mechanics [physics.class-ph]. Université de Strasbourg, 2021. English. ⟨NNT : 2021STRAD028⟩

Rain-on-grid software accounts for precipitation over a watershed as a source term in its nonlinear partial differential equations. As their discretization comprises a mesh of the watershed topography, their solution may fail due to memory shortage f

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od_______165::66e6d1a1f9a4c0bd9eaf880c88a76880
https://theses.hal.science/tel-03850417

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání