Samba Ndiaye

Orcid: 0009-0003-7568-4494

According to our database1, Samba Ndiaye authored at least 33 papers between 2002 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Approche hybride basée sur l'apprentissage automatique pour la réduction de graphes.
Proceedings of the Extraction et Gestion des Connaissances, 2024

2023
Toward an Ontology of Pattern Mining over Data Streams.
Proceedings of the Intelligent Systems and Pattern Recognition, 2023

2022
A parameter-free KNN for rating prediction.
Data Knowl. Eng., 2022

Une méthode KNN sans paramètre pour prédire les notes des utilisateurs.
Proceedings of the Extraction et Gestion des Connaissances, 2022

2020
ACO with automatic parameter selection for a scheduling problem with a group cumulative constraint.
Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020

Solving the Group Cumulative Scheduling Problem with CPO and ACO.
Proceedings of the Principles and Practice of Constraint Programming, 2020

2019
Deep Learning in Medical Imaging Survey.
Proceedings of the International Conference on Rural and Elderly Health Informatics (IREHI 2019), 2019

2018
A Parallelized Spark Based Version of mRMR.
Proceedings of the Innovations and Interdisciplinary Solutions for Underserved Areas, 2018

Observations from Parallelising Three Maximum Common (Connected) Subgraph Algorithms.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2018

Two Parallelized Filter Methods for Feature Selection Based on Spark.
Proceedings of the Emerging Technologies for Developing Countries, 2018

Vector Space Model of Text Classification Based on Inertia Contribution of Document.
Proceedings of the Emerging Technologies for Developing Countries, 2018

2017
Combining CP and ILP in a Tree Decomposition of Bounded Height for the Sum Colouring Problem.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2017

2016
Clique and Constraint Models for Maximum Common (Connected) Subgraph Problems.
Proceedings of the Principles and Practice of Constraint Programming, 2016

2015
GRAPP&S, a Peer-to-Peer Middleware for Interlinking and Sharing Educational Resources.
EAI Endorsed Trans. Ind. Networks Intell. Syst., 2015

Optimisation de requêtes dynamiques pour l'analyse de la biodiversité.
ARIMA J., 2015

A Comparison of Decomposition Methods for the Maximum Common Subgraph Problem.
Proceedings of the 27th IEEE International Conference on Tools with Artificial Intelligence, 2015

Contribution to SMS management over 4G network in distance education context.
Proceedings of the 12th IEEE/ACS International Conference of Computer Systems and Applications, 2015

2014
Approche de sélection d’attributs pour la classification basée sur l’algorithme RFE-SVM.
ARIMA J., 2014

Algorithmes de traitement de requêtes de biodiversité dans un environnement distribué.
ARIMA J., 2014

Experimental Comparison of BTD and Intelligent Backtracking: Towards an Automatic Per-instance Algorithm Selector.
Proceedings of the Principles and Practice of Constraint Programming, 2014

2013
GrAPP&S, a Distributed Framework for E-learning Resources Sharing.
Proceedings of the e-Infrastructure and e-Services for Developing Countries, 2013

2011
CP Models for Maximum Common Subgraph Problems.
Proceedings of the Principles and Practice of Constraint Programming - CP 2011, 2011

2009
On the notion of cycles in hypergraphs.
Discret. Math., 2009

Combined Strategies for Decomposition-Based Methods for Solving CSPs.
Proceedings of the ICTAI 2009, 2009

Database replication in large scale systems: optimizing the number of replicas.
Proceedings of the 2009 EDBT/ICDT Workshops, Saint-Petersburg, Russia, March 22, 2009, 2009

A Secure Protocol to Maintain Data Privacy in Data Mining.
Proceedings of the Advanced Data Mining and Applications, 5th International Conference, 2009

2008
Extending to Soft and Preference Constraints a Framework for Solving Efficiently Structured Problems.
Proceedings of the 20th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2008), 2008

A New Evaluation of Forward Checking and Its Consequences on Efficiency of Tools for Decomposition of CSPs.
Proceedings of the 20th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2008), 2008

2007
Dynamic Heuristics for Backtrack Search on Tree-Decomposition of CSPs.
Proceedings of the IJCAI 2007, 2007

Dynamic Management of Heuristics for Solving Structured CSPs.
Proceedings of the Principles and Practice of Constraint Programming, 2007

2006
An Extension of Complexity Bounds and Dynamic Heuristics for Tree-Decompositions of CSP.
Proceedings of the Principles and Practice of Constraint Programming, 2006

2005
Computing and Exploiting Tree-Decompositions for Solving Constraint Networks.
Proceedings of the Principles and Practice of Constraint Programming, 2005

2002
Deadlock and Livelock Free Concurrency Control by Value Dates for Scalable Distributed Data Structures.
Proceedings of the Distributed Data & Structures 4, 2002


  Loading...