default search action
Rachid Seghir
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j10]Wafa Aouadj
, Rachid Seghir
A fast and efficient teaching-learning-based optimization algorithm for large-scale multi-objective optimization problems. Int. J. Comput. Math. Comput. Syst. Theory 8(3): 160-177 (2023) - [j9]Kenza Khellas
Alabib-65: A Realistic Dataset for Algerian Sign Language Recognition. ACM Trans. Asian Low Resour. Lang. Inf. Process. 22(6): 178:1-178:23 (2023) - 2021
- [j8]Nabil Kadache
A New Social Volunteer Computing Environment With Task-Adapted Scheduling Policy (TASP). Int. J. Grid High Perform. Comput. 13(2): 39-55 (2021) - [j7]Wafa Aouadj
A Reliable Behavioral Model: Optimizing Energy Consumption and Object Clustering Quality by Naïve Robots. Int. J. Swarm Intell. Res. 12(4): 125-145 (2021) - [j6]Saliha Mezzoudj, Ali Behloul, Rachid Seghir
A parallel content-based image retrieval system using spark and tachyon frameworks. J. King Saud Univ. Comput. Inf. Sci. 33(2): 141-149 (2021) - [c6]Wafa Aouadj
Discrete Large-scale Multi-Objective Teaching-Learning-Based Optimization Algorithm. NISS (ACM) 2021: 29:1-29:6 - 2020
- [c5]Sonia Benbelgacem, Larbi Guezouli
A Distributed Information Retrieval Approach for Copyright Protection. NISS 2020: 63:1-63:6
2010 – 2019
- 2019
- [j5]Ikram Boubechal, Rachid Seghir, Redha Benzid:
A Generalized and Parallelized SSIM-Based Multilevel Thresholding Algorithm. Appl. Artif. Intell. 33(14): 1266-1289 (2019) - [j4]Saliha Mezzoudj, Ali Behloul, Rachid Seghir:
Towards large-scale face-based race classification on spark framework. Multim. Tools Appl. 78(18): 26729-26746 (2019) - 2017
- [j3]Toufik Baroudi, Rachid Seghir
Optimization of Triangular and Banded Matrix Operations Using 2d-Packed Layouts. ACM Trans. Archit. Code Optim. 14(4): 55:1-55:19 (2017) - 2015
- [c4]Moufida Aouachria
Towards a Repository for the Reuse of Business Process Models from a Requirements Analysis Perspective. IPAC 2015: 30:1-30:5 - 2012
- [j2]Rachid Seghir
Integer affine transformations of parametric ℤ-polytopes and applications to loop nest optimization. ACM Trans. Archit. Code Optim. 9(2): 8:1-8:27 (2012) - 2010
- [c3]Nour El-Houda Golea
A bind RGB color image watermarking based on singular value decomposition. AICCSA 2010: 1-5
2000 – 2009
- 2007
- [j1]Sven Verdoolaege
Counting Integer Points in Parametric Polytopes Using Barvinok's Rational Functions. Algorithmica 48(1): 37-66 (2007) - 2006
- [c2]Rachid Seghir
Memory optimization by counting points in integer transformations of parametric polytopes. CASES 2006: 74-82 - 2004
- [c1]Sven Verdoolaege, Rachid Seghir, Kristof Beyls, Vincent Loechner, Maurice Bruynooghe:
Analytical computation of Ehrhart polynomials: enabling more compiler analyses and optimizations. CASES 2004: 248-258
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: