default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAhmed Salam
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j13]Claude Brezinski, Michela Redivo-Zaglia
, Ahmed Salam:
On the kernel of vector ε-algorithm and related topics. Numer. Algorithms 92(1): 207-221 (2023)
2010 – 2019
- 2019
- [j12]Ahmed Salam, Haïthem Ben Kahla:
An upper J-Hessenberg reduction of a matrix through symplectic Householder transformations. Comput. Math. Appl. 78(1): 178-190 (2019) - [j11]Ahmed Salam, Haïthem Ben Kahla:
A treatment of breakdowns and near breakdowns in a reduction of a matrix to upper J-Hessenberg form and related topics. J. Comput. Appl. Math. 359: 16-29 (2019) - [j10]Youssef Bendraou, Fedwa Essannouni, Ahmed Salam:
From local to global key-frame extraction based on important scenes using SVD of centrist features. Multim. Tools Appl. 78(2): 1441-1456 (2019) - 2017
- [j9]Youssef Bendraou, Fedwa Essannouni, Driss Aboutajdine, Ahmed Salam:
Shot boundary detection via adaptive low rank and svd-updating. Comput. Vis. Image Underst. 161: 20-28 (2017) - 2016
- [c5]Youssef Bendraou, Fedwa Essannouni, Ahmed Salam, Driss Aboutajdine:
Video Cut Detector via Adaptive Features using the Frobenius Norm. ISVC (2) 2016: 380-389 - 2015
- [j8]Skander Belhaj, Marwa Dridi, Ahmed Salam:
A fast algorithm for solving banded Toeplitz systems. Comput. Math. Appl. 70(12): 2958-2967 (2015)
2000 – 2009
- 2007
- [j7]Fedwa Essannouni, Rachid Oulad Haj Thami, Driss Aboutajdine, Ahmed Salam:
Adjustable SAD matching algorithm using frequency domain. J. Real Time Image Process. 1(4): 257-265 (2007) - [c4]Fedwa Essannouni, Rachid Oulad Haj Thami, Driss Aboutajdine, Ahmed Salam:
Optimal Frequency SSD Matching Using Cosine Kernel. ICECS 2007: 119-122 - 2006
- [c3]Fedwa Essannouni, Rachid Oulad Haj Thami, Ahmed Salam, Driss Aboutajdine:
An Optimal and Statistically Robust Correlation Technique for Block Based Motion Estimation. ICME 2006: 233-236 - 2005
- [j6]Ahmed Salam:
On theoretical and numerical aspects of symplectic Gram-Schmidt-like algorithms. Numer. Algorithms 39(4): 437-462 (2005) - [c2]Fedwa Essannouni, Rachid Oulad Haj Thami, Ahmed Salam, Driss Aboutajdine:
A new fast full search block matching algorithm using frequency domain. ISSPA 2005: 559-562 - [c1]Fedwa Essannouni, Rachid Oulad Haj Thami, Ahmed Salam, Driss Aboutajdine:
A new integer and reversible color transform for an efficient extension of phase correlation method to color images. SMC 2005: 2685-2689 - 2002
- [j5]Ahmed Salam, Peter R. Graves-Morris:
On the Vector ε-Algorithm for Solving Linear Systems of Equations. Numer. Algorithms 29(1-3): 229-247 (2002)
1990 – 1999
- 1999
- [j4]Peter R. Graves-Morris, Ahmed Salam:
Avoiding breakdown in Van der Vorst's method. Numer. Algorithms 21(1-4): 205-223 (1999) - 1998
- [j3]Ahmed Salam:
Formal vector orthogonal polynomials. Adv. Comput. Math. 8(3): 267-289 (1998) - 1996
- [j2]Ahmed Salam:
An algebraic approach to the vector ε-algorithm. Numer. Algorithms 11(1): 327-337 (1996) - 1994
- [j1]Ahmed Salam:
Non-commutative extrapolation algorithms. Numer. Algorithms 7(2): 225-251 (1994)
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 2025-01-06 20:02 CET 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:
