Wady Naanaa

According to our database1, Wady Naanaa authored at least 41 papers between 1995 and 2022.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Generating random graphs with hard and soft constraints.
Int. J. Comput. Aided Eng. Technol., 2022

Convexity aware Signed Graph Convolutional Neural Network for 3D Object Retrieval.
Proceedings of the Knowledge-Based and Intelligent Information & Engineering Systems: Proceedings of the 26th International Conference KES-2022, 2022

Approximating Sparse Semi-nonnegative Matrix Factorization for X-Ray Covid-19 Image Classification.
Proceedings of the Advances in Computational Collective Intelligence, 2022

RingNet: Geometric Deep Representation Learning for 3D Multi-domain Protein Shape Retrieval.
Proceedings of the Computational Collective Intelligence - 14th International Conference, 2022

2021
Deep sparse dictionary-based representation for 3D non-rigid shape retrieval.
Proceedings of the SAC '21: The 36th ACM/SIGAPP Symposium on Applied Computing, 2021

Soft Directional Substitutable based Decompositions for MOVCSP.
Proceedings of the 10th International Conference on Operations Research and Enterprise Systems, 2021

2020
A new approximate cluster deletion algorithm for diamond-free graphs.
J. Comb. Optim., 2020

New schemes for simplifying binary constraint satisfaction problems.
Discret. Math. Theor. Comput. Sci., 2020

Constraints for generating graphs with imposed and forbidden patterns: an application to molecular graphs.
Constraints An Int. J., 2020

2019
On Generating Random Graphs Based on Fuzzy Proximity Relationships between Vertices.
Res. Comput. Sci., 2019

Pareto-based Soft Arc Consistency for Multi-objective Valued CSPs.
Proceedings of the 11th International Conference on Agents and Artificial Intelligence, 2019

2018
Local commute-time guided MDS for 3D non-rigid object retrieval.
Appl. Intell., 2018

A polynomial relational class of binary CSP.
Ann. Math. Artif. Intell., 2018

2017
Extreme direction analysis for blind separation of nonnegative signals.
Signal Process., 2017

Adaptive vectorial lifting concept for convolutive blind source separation.
Pattern Anal. Appl., 2017

Content-Based Retrieval of 3D Non Rigid Object with Sparse Representations and Local Feature Descriptors: A Comparative Study.
Proceedings of the 14th IEEE/ACS International Conference on Computer Systems and Applications, 2017

2016
A new multi-scale framework for convolutive blind source separation.
Signal Image Video Process., 2016

A constrained molecular graph generation with imposed and forbidden fragments.
Proceedings of the 9th Hellenic Conference on Artificial Intelligence, 2016

Extending the Broken Triangle Property tractable class of binary CSPs.
Proceedings of the 9th Hellenic Conference on Artificial Intelligence, 2016

Multiscale convolutive blind source separation in wavelet transform domain.
Proceedings of the 31st Annual ACM Symposium on Applied Computing, 2016

Local Feature-Based 3D Canonical Form.
Proceedings of the Representations, Analysis and Recognition of Shape and Motion from Imaging Data, 2016

LDS vs FPT Method for Cluster Deletion.
Proceedings of the 28th IEEE International Conference on Tools with Artificial Intelligence, 2016

A new polynomial class of cluster deletion problem.
Proceedings of the 2016 Federated Conference on Computer Science and Information Systems, 2016

A new polynomial cluster deletion subproblem.
Proceedings of the 13th IEEE/ACS International Conference of Computer Systems and Applications, 2016

2015
Digital in-line particle holography: twin-image suppression using sparse blind source separation.
Signal Image Video Process., 2015

Non-negative matrix factorisation for blind source separation in wavelet transform domain.
IET Signal Process., 2015

A Constraint Programming Approach to the Cluster Deletion Problem.
Proceedings of the Thirteenth Scandinavian Conference on Artificial Intelligence, 2015

2014
A Constraint Programming Approach to the Zahn's Decision Problem.
Proceedings of the Distributed Computing and Artificial Intelligence, 2014

2013
Unifying and extending hybrid tractable classes of CSPs.
J. Exp. Theor. Artif. Intell., 2013

Submodularity-Based Decomposing for Valued CSP.
Int. J. Artif. Intell. Tools, 2013

Modularity-based decompositions for valued CSP.
Ann. Math. Artif. Intell., 2013

Multiresolution convolutive blind source separation using adaptive lifting scheme.
Proceedings of the 20th IEEE International Conference on Electronics, 2013

2012
A geometric approach to blind separation of nonnegative and dependent source signals.
Signal Process., 2012

A submodular-based decomposition strategy for valued CSPs.
Proceedings of the STAIRS 2012, 2012

2010
A geometric approach to blind separation of nonnegative and dependent source signals.
Proceedings of the 18th European Signal Processing Conference, 2010

2008
A domain decomposition algorithm for constraint satisfaction.
ACM J. Exp. Algorithmics, 2008

2007
Directional Interchangeability for Enhancing CSP Solving.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2007

YIELDS: A Yet Improved Limited Discrepancy Search for CSPs.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2007

2005
Blind source separation of positive and partially correlated data.
Signal Process., 2005

1998
Handling structured and ambiguous constraints in constraint satisfaction problems.
J. Exp. Theor. Artif. Intell., 1998

1995
Applying the constraint satisfaction problem paradigm to structure generation.
J. Chem. Inf. Comput. Sci., 1995


  Loading...