Остановите войну!
for scientists:
default search action
Elza Erkip
- > Home > Persons > Elza Erkip
Publications
- 2023
- [c166]Fabrizio Carpi, Sivarama Venkatesan, Jinfeng Du, Harish Viswanathan, Siddharth Garg, Elza Erkip:
Precoding-oriented Massive MIMO CSI Feedback Design. ICC 2023: 4973-4978 - [c165]Kai Pfeiffer, Yuze Jia, Mingsheng Yin, Akshaj Kumar Veldanda, Yaqi Hu, Amee Trivedi, Jeff Zhang, Siddharth Garg, Elza Erkip, Sundeep Rangan, Ludovic Righetti:
Path Planning Under Uncertainty to Localize mmWave Sources. ICRA 2023: 3461-3467 - [i126]Fabrizio Carpi, Sivarama Venkatesan, Jinfeng Du, Harish Viswanathan, Siddharth Garg, Elza Erkip:
Precoding-oriented Massive MIMO CSI Feedback Design. CoRR abs/2302.11526 (2023) - [i125]Kai Pfeiffer, Yuze Jia, Mingsheng Yin, Akshaj Kumar Veldanda, Yaqi Hu, Amee Trivedi, Jeff Zhang, Siddharth Garg, Elza Erkip, Sundeep Rangan, Ludovic Righetti:
Path Planning Under Uncertainty to Localize mmWave Sources. CoRR abs/2303.03739 (2023) - 2022
- [j81]Mingsheng Yin, Akshaj Kumar Veldanda, Amee Trivedi, Jeff Zhang, Kai Pfeiffer, Yaqi Hu, Siddharth Garg, Elza Erkip, Ludovic Righetti, Sundeep Rangan:
Millimeter Wave Wireless Assisted Robot Navigation With Link State Classification. IEEE Open J. Commun. Soc. 3: 493-507 (2022) - [c155]Zhongzheng Yuan, Samyak Rawlekar, Siddharth Garg, Elza Erkip, Yao Wang:
Feature Compression for Rate Constrained Object Detection on the Edge. MIPR 2022: 1-6 - [i113]Zhongzheng Yuan, Samyak Rawlekar, Siddharth Garg, Elza Erkip, Yao Wang:
Feature Compression for Rate Constrained Object Detection on the Edge. CoRR abs/2204.07314 (2022) - 2021
- [j78]Farhad Shirani, Siddharth Garg, Elza Erkip:
A Concentration of Measure Approach to Correlated Graph Matching. IEEE J. Sel. Areas Inf. Theory 2(1): 338-351 (2021) - [c148]Mahshad Shariatnasab, Farhad Shirani, Siddharth Garg, Elza Erkip:
On Graph Matching Using Generalized Seed Side-Information. ISIT 2021: 2726-2731 - [c146]Fabrizio Carpi, Siddharth Garg, Elza Erkip:
Single-Shot Compression for Hypothesis Testing. SPAWC 2021: 176-180 - [i109]Mahshad Shariatnasab, Farhad Shirani, Siddharth Garg, Elza Erkip:
On Graph Matching Using Generalized Seed Side-Information. CoRR abs/2102.06267 (2021) - [i103]Fabrizio Carpi, Siddharth Garg, Elza Erkip:
Single-Shot Compression for Hypothesis Testing. CoRR abs/2107.09778 (2021) - [i102]Mingsheng Yin, Akshaj Kumar Veldanda, Amee Trivedi, Jeff Zhang, Kai Pfeiffer, Yaqi Hu, Siddharth Garg, Elza Erkip, Ludovic Righetti, Sundeep Rangan:
Millimeter Wave Wireless-Assisted Robotic Navigation with Link State Classification. CoRR abs/2110.14789 (2021) - 2020
- [i97]Farhad Shirani, Siddharth Garg, Elza Erkip:
On the Joint Typicality of Permutations of Sequences of Random Variables. CoRR abs/2001.06962 (2020) - [i94]Farhad Shirani, Siddharth Garg, Elza Erkip:
A Concentration of Measure Approach to Correlated Graph Matching. CoRR abs/2009.00467 (2020) - 2019
- [c135]Farhad Shirani, Siddharth Garg, Elza Erkip:
A Concentration of Measure Approach to Database De-anonymization. ISIT 2019: 2748-2752 - [i92]Farhad Shirani, Siddharth Garg, Elza Erkip:
A Concentration of Measure Approach to Database De-anonymization. CoRR abs/1901.07655 (2019) - 2018
- [c128]Farhad Shirani, Siddharth Garg, Elza Erkip:
Matching Graphs with Community Structure: A Concentration of Measure Approach. Allerton 2018: 1028-1035 - [c126]Farhad Shirani, Siddharth Garg, Elza Erkip:
Typicality Matching for Pairs of Correlated Graphs. ISIT 2018: 221-225 - [c124]Farhad Shirani, Siddharth Garg, Elza Erkip:
Optimal Active social Network De-anonymization Using Information Thresholds. ISIT 2018: 1445-1449 - [i83]Farhad Shirani, Siddharth Garg, Elza Erkip:
Optimal Active Social Network De-anonymization Using Information Thresholds. CoRR abs/1801.06498 (2018) - [i81]Farhad Shirani, Siddharth Garg, Elza Erkip:
Typicality Matching for Pairs of Correlated Graphs. CoRR abs/1802.00918 (2018) - [i75]Farhad Shirani, Siddharth Garg, Elza Erkip:
Matching Graphs with Community Structure: A Concentration of Measure Approach. CoRR abs/1810.13347 (2018) - 2017
- [c121]Farhad Shirani, Siddharth Garg, Elza Erkip:
Seeded graph matching: Efficient algorithms and theoretical guarantees. ACSSC 2017: 253-257 - [c117]Farhad Shirani, Siddharth Garg, Elza Erkip:
An information theoretic framework for active de-anonymization in social networks based on group memberships. Allerton 2017: 470-477 - [i68]Farhad Shirani, Siddharth Garg, Elza Erkip:
An Information Theoretic Framework for Active De-anonymization in Social Networks Based on Group Memberships. CoRR abs/1710.04163 (2017) - [i67]Farhad Shirani, Siddharth Garg, Elza Erkip:
Seeded Graph Matching: Efficient Algorithms and Theoretical Guarantees. CoRR abs/1711.10360 (2017) - 2016
- [c112]Efe Onaran, Siddharth Garg, Elza Erkip:
Optimal de-anonymization in random graphs with community structure. ACSSC 2016: 709-713 - [c103]Efe Onaran, Siddharth Garg, Elza Erkip:
Optimal de-anonymization in random graphs with community structure. Sarnoff Symposium 2016: 1-2 - [i63]Efe Onaran, Siddharth Garg, Elza Erkip:
Optimal De-Anonymization in Random Graphs with Community Structure. CoRR abs/1602.01409 (2016)
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-04-25 02: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