default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMina Karzand
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c10]Anmol Kabra, Mina Karzand, Tosca Lechner, Nati Srebro, Serena Lutong Wang:
Score Design for Multi-Criteria Incentivization. FORC 2024: 8:1-8:22- [i7]Anmol Kabra, Mina Karzand, Tosca Lechner, Nathan Srebro, Serena Lutong Wang:
Score Design for Multi-Criteria Incentivization. CoRR abs/2410.06290 (2024) - 2021
- [j3]Guy Bresler, Mina Karzand
:
Regret Bounds and Regimes of Optimality for User-User and Item-Item Collaborative Filtering. IEEE Trans. Inf. Theory 67(6): 4197-4222 (2021) - [c9]Zhen Dai, Mina Karzand, Nathan Srebro:
Representation Costs of Linear Neural Networks: Analysis and Design. NeurIPS 2021: 26884-26896 - 2020
- [j2]Mina Karzand, Robert D. Nowak:
MaxiMin Active Learning in Overparameterized Model Classes. IEEE J. Sel. Areas Inf. Theory 1(1): 167-177 (2020) - [c8]Guy Bresler, Mina Karzand:
Minimax Prediction in Tree Ising Models. ISIT 2020: 1325-1330
2010 – 2019
- 2019
- [c7]Mina Karzand, Robert D. Nowak:
Maximin Active Learning with Data-Dependent Norms. Allerton 2019: 871-878 - [i6]Mina Karzand, Robert D. Nowak:
Active Learning in the Overparameterized and Interpolating Regime. CoRR abs/1905.12782 (2019) - 2018
- [c6]Guy Bresler, Mina Karzand:
Regret Bounds and Regimes of Optimality for User-User and Item-Item Collaborative Filtering. ITA 2018: 1-37 - 2017
- [b1]Mina Karzand:
Theoretical study of two prediction-centric problems: graphical model learning and recommendations. Massachusetts Institute of Technology, Cambridge, USA, 2017 - [i5]Guy Bresler, Mina Karzand:
Regret Bounds and Regimes of Optimality for User-User and Item-Item Collaborative Filtering. CoRR abs/1711.02198 (2017) - 2016
- [i4]Guy Bresler, Mina Karzand:
Learning a Tree-Structured Ising Model in Order to Make Predictions. CoRR abs/1604.06749 (2016) - 2015
- [c5]Mina Karzand, Guy Bresler:
Inferning trees. Allerton 2015: 1344-1351 - [c4]Mina Karzand, Lav R. Varshney:
Communication strategies for low-latency trading. ISIT 2015: 2121-2125 - [i3]Mina Karzand, Lav R. Varshney:
Communication Strategies for Low-Latency Trading. CoRR abs/1504.07227 (2015) - 2014
- [c3]Mina Karzand, Lizhong Zheng:
Degrees of freedom in fading channels with memory: Achievability through nonlinear decoding. Allerton 2014: 1252-1259 - [c2]Mina Karzand, Lizhong Zheng:
Achievability of nonlinear degrees of freedom in correlatively changing fading channels. CISS 2014: 1-6 - [i2]Mina Karzand, Lizhong Zheng:
Achievability of Nonlinear Degrees of Freedom in Correlatively Changing Fading Channels. CoRR abs/1401.2169 (2014) - [i1]Mina Karzand, Lizhong Zheng:
Achievable Degrees of Freedom in MIMO Correlatively Changing Fading Channels. CoRR abs/1401.6512 (2014) - 2010
- [j1]Yue M. Lu, Mina Karzand, Martin Vetterli:
Demosaicking by Alternating Projections: Theory and Fast One-Step Implementation. IEEE Trans. Image Process. 19(8): 2085-2098 (2010)
2000 – 2009
- 2009
- [c1]Yue M. Lu, Mina Karzand, Martin Vetterli:
Iterative demosaicking accelerated: theory and fast noniterative implementations. Computational Imaging 2009: 72460
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-11-20 21:00 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:
