default search action
Christopher Harshaw
Person information
- affiliation: Yale University, CT, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j3]Moran Feldman, Christopher Harshaw, Amin Karbasi:
How Do You Want Your Greedy: Simultaneous or Repeated? J. Mach. Learn. Res. 24: 72:1-72:87 (2023) - [c7]Jessica Dai, Paula Gradu, Christopher Harshaw:
CLIP-OGD: An Experimental Design for Adaptive Neyman Allocation in Sequential Experiments. NeurIPS 2023 - [i7]Jessica Dai, Paula Gradu, Christopher Harshaw:
Clip-OGD: An Experimental Design for Adaptive Neyman Allocation in Sequential Experiments. CoRR abs/2305.17187 (2023) - 2022
- [j2]Christopher Harshaw, Ehsan Kazemi, Moran Feldman, Amin Karbasi:
The Power of Subsampling in Submodular Maximization. Math. Oper. Res. 47(2): 1365-1393 (2022) - [c6]Christopher Harshaw, Fredrik Sävje, David Eisenstat, Vahab Mirrokni, Jean Pouget-Abadie:
Design and Analysis of Bipartite Experiments Under a Linear Exposure-response Model. EC 2022: 606 - 2021
- [i6]Christopher Harshaw, Ehsan Kazemi, Moran Feldman, Amin Karbasi:
The Power of Subsampling in Submodular Maximization. CoRR abs/2104.02772 (2021) - 2020
- [j1]Dilantha Haputhanthri, Gunavaran Brihadiswaran, Sahan Gunathilaka, Dulani Meedeniya, Sampath Jayarathna, Mark Jaime, Christopher Harshaw:
Integration of Facial Thermography in EEG-based Classification of ASD. Int. J. Autom. Comput. 17(6): 837-854 (2020) - [i5]Moran Feldman, Christopher Harshaw, Amin Karbasi:
Simultaneous Greedys: A Swiss Army Knife for Constrained Submodular Maximization. CoRR abs/2009.13998 (2020)
2010 – 2019
- 2019
- [c5]Chris Harshaw, Moran Feldman, Justin Ward, Amin Karbasi:
Submodular Maximization beyond Non-negativity: Guarantees, Fast Algorithms, and Applications. ICML 2019: 2634-2643 - [c4]Omid Alipourfard, Jiaqi Gao, Jérémie Koenig, Chris Harshaw, Amin Vahdat, Minlan Yu:
Risk based planning of network changes in evolving data centers. SOSP 2019: 414-429 - [i4]Christopher Harshaw, Moran Feldman, Justin Ward, Amin Karbasi:
Submodular Maximization Beyond Non-negativity: Guarantees, Fast Algorithms, and Applications. CoRR abs/1904.09354 (2019) - [i3]Christopher Harshaw, Fredrik Sävje, Daniel A. Spielman, Peng Zhang:
Balancing covariates in randomized experiments using the Gram-Schmidt walk. CoRR abs/1911.03071 (2019) - 2018
- [c3]Lin Chen, Christopher Harshaw, Hamed Hassani, Amin Karbasi:
Projection-Free Online Optimization with Stochastic Gradient: From Convexity to Submodularity. ICML 2018: 813-822 - 2017
- [c2]Moran Feldman, Christopher Harshaw, Amin Karbasi:
Greed Is Good: Near-Optimal Submodular Maximization via Greedy Optimization. COLT 2017: 758-784 - [i2]Moran Feldman, Christopher Harshaw, Amin Karbasi:
Greed is Good: Near-Optimal Submodular Maximization via Greedy Optimization. CoRR abs/1704.01652 (2017) - 2016
- [c1]Christopher R. Harshaw, Robert A. Bridges, Michael D. Iannacone, Joel W. Reed, John R. Goodall:
GraphPrints: Towards a Graph Analytic Method for Network Anomaly Detection. CISRC 2016: 15:1-15:4 - [i1]Christopher R. Harshaw, Robert A. Bridges, Michael D. Iannacone, Joel W. Reed, John R. Goodall:
GraphPrints: Towards a Graph Analytic Method for Network Anomaly Detection. CoRR abs/1602.01130 (2016)
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-13 00:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint