default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDParisa Hassanzadeh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c15]JoonHo Lee, Jae Oh Woo, Juree Seok, Parisa Hassanzadeh, Wooseok Jang, JuYoun Son, Sima Didari, Baruch Gutow, Heng Hao, Hankyu Moon, Wenjun Hu, Yeong-Dae Kwon, Taehee Lee, Seungjai Min:
Improving Instruction Following in Language Models through Proxy-Based Uncertainty Estimation. ICML 2024- [i20]JoonHo Lee, Jae Oh Woo, Juree Seok, Parisa Hassanzadeh, Wooseok Jang, JuYoun Son, Sima Didari, Baruch Gutow, Heng Hao, Hankyu Moon, Wenjun Hu, Yeong-Dae Kwon
, Taehee Lee, Seungjai Min:
Improving Instruction Following in Language Models through Proxy-Based Uncertainty Estimation. CoRR abs/2405.06424 (2024) - 2023
- [c14]Defu Cao, Yixiang Zheng, Parisa Hassanzadeh, Simran Lamba, Xiaomo Liu, Yan Liu:
Large Scale Financial Time Series Forecasting with Multi-faceted Model. ICAIF 2023: 472-480 - [c13]Parisa Hassanzadeh, Eleonora Kreacic, Sihan Zeng, Yuchen Xiao, Sumitra Ganesh:
Sequential Fair Resource Allocation under a Markov Decision Process Framework. ICAIF 2023: 673-680 - [c12]Yanchao Sun, Ruijie Zheng, Parisa Hassanzadeh, Yongyuan Liang, Soheil Feizi, Sumitra Ganesh, Furong Huang:
Certifiably Robust Policy Learning against Adversarial Multi-Agent Communication. ICLR 2023 - [i19]Parisa Hassanzadeh, Eleonora Kreacic, Sihan Zeng, Yuchen Xiao, Sumitra Ganesh:
Sequential Fair Resource Allocation under a Markov Decision Process Framework. CoRR abs/2301.03758 (2023) - [i18]Sihan Zeng, Sujay Bhatt, Eleonora Kreacic, Parisa Hassanzadeh, Alec Koppel, Sumitra Ganesh:
Near-Optimal Fair Resource Allocation for Strategic Agents without Money: A Data-Driven Approach. CoRR abs/2311.10927 (2023) - 2022
- [c11]Marc Rigter, Danial Dervovic, Parisa Hassanzadeh, Jason Long, Parisa Zehtabi, Daniele Magazzeni:
Optimal Admission Control for Multiclass Queues with Time-Varying Arrival Rates via State Abstraction. AAAI 2022: 9918-9925 - [i17]Marc Rigter, Danial Dervovic, Parisa Hassanzadeh, Jason Long, Parisa Zehtabi, Daniele Magazzeni:
Optimal Admission Control for Multiclass Queues with Time-Varying Arrival Rates via State Abstraction. CoRR abs/2203.08019 (2022) - [i16]Parisa Hassanzadeh, Robert E. Tillman:
Generative Models with Information-Theoretic Protection Against Membership Inference Attacks. CoRR abs/2206.00071 (2022) - [i15]Yanchao Sun, Ruijie Zheng, Parisa Hassanzadeh, Yongyuan Liang, Soheil Feizi, Sumitra Ganesh, Furong Huang:
Certifiably Robust Policy Learning against Adversarial Communication in Multi-agent Systems. CoRR abs/2206.10158 (2022) - 2021
- [j5]Shahram Shahsavari, Mehrdad Nosrati, Parisa Hassanzadeh, Alexei Ashikhmin, Thomas L. Marzetta, Elza Erkip:
Multi-Point Coordination in Massive MIMO Systems With Sectorized Antennas. IEEE Trans. Commun. 69(11): 7559-7575 (2021) - [c10]Parisa Hassanzadeh, Danial Dervovic, Samuel Assefa, Prashant Reddy, Manuela Veloso:
Tradeoffs in streaming binary classification under limited inspection resources. ICAIF 2021: 36:1-36:9 - [c9]Danial Dervovic, Parisa Hassanzadeh, Samuel Assefa, Prashant Reddy:
Non-Parametric Stochastic Sequential Assignment With Random Arrival Times. IJCAI 2021: 4214-4220 - [i14]Shahram Shahsavari, Mehrdad Nosrati, Parisa Hassanzadeh, Alexei Ashikhmin, Thomas L. Marzetta, Elza Erkip:
Multi-point Coordination in Massive MIMO Systems with Sectorized Antennas. CoRR abs/2104.10805 (2021) - [i13]Danial Dervovic, Parisa Hassanzadeh, Samuel Assefa, Prashant Reddy:
Non-Parametric Stochastic Sequential Assignment With Random Arrival Times. CoRR abs/2106.04944 (2021) - [i12]Parisa Hassanzadeh, Danial Dervovic, Samuel Assefa, Prashant Reddy, Manuela Veloso:
Tradeoffs in Streaming Binary Classification under Limited Inspection Resources. CoRR abs/2110.02403 (2021) - 2020
- [j4]Qianqian Yang, Parisa Hassanzadeh, Deniz Gündüz, Elza Erkip:
Centralized Caching and Delivery of Correlated Contents Over Gaussian Broadcast Channels. IEEE Trans. Commun. 68(1): 122-136 (2020) - [j3]Parisa Hassanzadeh, Antonia M. Tulino, Jaime Llorca, Elza Erkip:
Rate-Memory Trade-Off for Caching and Delivery of Correlated Sources. IEEE Trans. Inf. Theory 66(4): 2219-2251 (2020) - [j2]Parisa Hassanzadeh, Antonia M. Tulino, Jaime Llorca, Elza Erkip:
Rate-Distortion-Memory Trade-Offs in Heterogeneous Caching Networks. IEEE Trans. Wirel. Commun. 19(5): 3019-3033 (2020)
2010 – 2019
- 2019
- [i11]Parisa Hassanzadeh, Antonia M. Tulino, Jaime Llorca, Elza Erkip:
Rate-Distortion-Memory Trade-offs in Heterogeneous Caching Networks. CoRR abs/1905.09446 (2019) - [i10]Qianqian Yang, Parisa Hassanzadeh, Deniz Gündüz, Elza Erkip:
Centralized Caching and Delivery of Correlated Contents over Gaussian Broadcast Channels. CoRR abs/1906.09970 (2019) - 2018
- [j1]Parisa Hassanzadeh, Antonia M. Tulino, Jaime Llorca, Elza Erkip:
On Coding for Cache-Aided Delivery of Dynamic Correlated Content. IEEE J. Sel. Areas Commun. 36(8): 1666-1681 (2018) - [c8]Qianqian Yang, Parisa Hassanzadeh, Deniz Gündüz, Elza Erkip:
Centralized caching and delivery of correlated contents over a Gaussian broadcast channel. WiOpt 2018: 1-6 - [i9]Qianqian Yang, Parisa Hassanzadeh, Deniz Gündüz, Elza Erkip:
Centralized Caching and Delivery of Correlated Contents over a Gaussian Broadcast Channel. CoRR abs/1804.10152 (2018) - [i8]Parisa Hassanzadeh, Antonia M. Tulino, Jaime Llorca, Elza Erkip:
On Coding for Cache-Aided Delivery of Dynamic Correlated Content. CoRR abs/1806.04753 (2018) - [i7]Parisa Hassanzadeh, Antonia M. Tulino, Jaime Llorca, Elza Erkip:
Rate-Memory Trade-Off for Caching and Delivery of Correlated Sources. CoRR abs/1806.07333 (2018) - 2017
- [c7]Shahram Shahsavari, Parisa Hassanzadeh, Alexei E. Ashikhmin, Elza Erkip:
Sectoring in multi-cell massive MIMO systems. ACSSC 2017: 1050-1055 - [c6]Parisa Hassanzadeh, Antonia M. Tulino, Jaime Llorca, Elza Erkip:
Broadcast caching networks with two receivers and multiple correlated sources. ACSSC 2017: 1449-1454 - [c5]Parisa Hassanzadeh, Antonia M. Tulino, Jaime Llorca, Elza Erkip:
Rate-memory trade-off for the two-user broadcast caching network with correlated sources. ISIT 2017: 1227-1231 - [i6]Parisa Hassanzadeh, Antonia M. Tulino, Jaime Llorca, Elza Erkip:
Rate-Memory Trade-off for the Two-User Broadcast Caching Network with Correlated Sources. CoRR abs/1705.04616 (2017) - [i5]Shahram Shahsavari, Parisa Hassanzadeh, Alexei E. Ashikhmin, Elza Erkip:
Sectoring in Multi-cell Massive MIMO Systems. CoRR abs/1707.09070 (2017) - [i4]Parisa Hassanzadeh, Antonia M. Tulino, Jaime Llorca, Elza Erkip:
Broadcast Caching Networks with Two Receivers and Multiple Correlated Sources. CoRR abs/1712.01464 (2017) - 2016
- [c4]Parisa Hassanzadeh, Antonia M. Tulino, Jaime Llorca, Elza Erkip:
Cache-aided coded multicast for correlated sources. ISTC 2016: 360-364 - [c3]Parisa Hassanzadeh, Antonia M. Tulino, Jaime Llorca, Elza Erkip:
Correlation-aware distributed caching and coded delivery. ITW 2016: 166-170 - [c2]Parisa Hassanzadeh, Antonia M. Tulino, Jaime Llorca, Elza Erkip:
Memory-rate trade-off for caching and delivery of correlated sources. Sarnoff Symposium 2016: 1-2 - [i3]Parisa Hassanzadeh, Antonia M. Tulino, Jaime Llorca, Elza Erkip:
Cache-Aided Coded Multicast for Correlated Sources. CoRR abs/1609.05831 (2016) - [i2]Parisa Hassanzadeh, Antonia M. Tulino, Jaime Llorca, Elza Erkip:
Correlation-Aware Distributed Caching and Coded Delivery. CoRR abs/1609.05836 (2016) - 2015
- [c1]Parisa Hassanzadeh, Elza Erkip, Jaime Llorca, Antonia M. Tulino:
Distortion-memory tradeoffs in cache-aided wireless video delivery. Allerton 2015: 1150-1157 - [i1]Parisa Hassanzadeh, Elza Erkip, Jaime Llorca, Antonia M. Tulino:
Distortion-Memory Tradeoffs in Cache-Aided Wireless Video Delivery. CoRR abs/1511.03932 (2015)
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-09-04 01:23 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:
