default search action
Ahmed Zaki
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c10]Shida Ye, Yaakov Bar-Shalom, Peter Willett, Ahmed Zaki:
Maximum Likelihood Identification of an Ornstein-Uhlenbeck Model and Its CRLB. FUSION 2024: 1-8
2010 – 2019
- 2019
- [j4]Ahmed Zaki, Partha P. Mitra, Lars K. Rasmussen, Saikat Chatterjee:
Estimate exchange over network is good for distributed hard thresholding pursuit. Signal Process. 156: 1-11 (2019) - [c9]Ahmed Zaki, Saikat Chatterjee:
Convex Optimization Based Sparse Learning Over Networks. EUSIPCO 2019: 1-5 - 2018
- [b1]Ahmed Zaki:
Cooperative Compressive Sampling. Royal Institute of Technology, Stockholm, Sweden, 2018 - [j3]Ahmed Zaki, Arun Venkitaraman, Saikat Chatterjee, Lars Kildehoj Rasmussen:
Greedy Sparse Learning Over Network. IEEE Trans. Signal Inf. Process. over Networks 4(3): 424-435 (2018) - [i2]Ahmed Zaki, Saikat Chatterjee, Partha P. Mitra, Lars K. Rasmussen:
Locally Convex Sparse Learning over Networks. CoRR abs/1804.00130 (2018) - 2017
- [j2]Ahmed Zaki, Saikat Chatterjee, Lars K. Rasmussen:
Generalized fusion algorithm for compressive sampling reconstruction and RIP-based analysis. Signal Process. 139: 36-48 (2017) - [c8]Ahmed Zaki, Arun Venkitaraman, Saikat Chatterjee, Lars K. Rasmussen:
Distributed greedy sparse learning over doubly stochastic networks. EUSIPCO 2017: 361-364 - 2015
- [c7]Ahmed Zaki, Saikat Chatterjee, Lars K. Rasmussen:
Universal algorithm for compressive sampling. EUSIPCO 2015: 689-693 - 2013
- [c6]Ahmed Zaki, Chao Wang, Lars K. Rasmussen:
Combining interference alignment and Alamouti codes for the 3-user MIMO interference channel. WCNC 2013: 3563-3567 - 2012
- [c5]Ahmed Zaki, Mostafa A. Salama, Hesham A. Hefny, Aboul Ella Hassanien:
Rough Sets-Based Rules Generation Approach: A Hepatitis C Virus Data Sets. AMLTA 2012: 52-59
2000 – 2009
- 2009
- [j1]Saif K. Mohammed, Ahmed Zaki, Ananthanarayanan Chockalingam, B. Sundar Rajan:
High-Rate Space-Time Coded Large-MIMO Systems: Low-Complexity Detection and Channel Estimation. IEEE J. Sel. Top. Signal Process. 3(6): 958-974 (2009) - [c4]Ahmed Zaki, Saif K. Mohammed, Ananthanarayanan Chockalingam, B. Sundar Rajan:
A Training-Based Iterative Detection/Channel Estimation Scheme for Large Non-Orthogonal STBC MIMO Systems. ICC 2009: 1-5 - [c3]Ahmed Zaki, Ananthanarayanan Chockalingam:
Joint channel estimation/detection in MIMO systems using belief propagation. PIMRC 2009: 466-470 - 2008
- [i1]Saif K. Mohammed, Ahmed Zaki, Ananthanarayanan Chockalingam, B. Sundar Rajan:
High-Rate Space-Time Coded Large MIMO: Low-Complexity Detection and Channel Estimation. CoRR abs/0809.2446 (2008)
1990 – 1999
- 1994
- [c2]J. Leon Zhao, Ahmed Zaki:
Spatial Data Traversal in Road Map Databases: A Graph Indexing Approach. CIKM 1994: 355-362
1980 – 1989
- 1981
- [c1]Hon-Shiang Lau, Ahmed Zaki:
The sensitivity of queueing models simulation to time discretization. WSC 1981: 341-345
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-25 21:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint