default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHanna Mazzawi
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c13]Hanna Mazzawi, Javier Gonzalvo, Michael Wunder, Sammy Jerome, Benoit Dherin:
Deep Fusion: Efficient Network Training via Pre-trained Initializations. ICML 2024- [i10]Hanna Mazzawi, Pranjal Awasthi, Xavi Gonzalvo, Srikumar Ramalingam:
Simulated Overparameterization. CoRR abs/2402.05033 (2024) - 2023
- [i9]Hanna Mazzawi, Xavi Gonzalvo, Michael Wunder:
Deep Fusion: Efficient Network Training via Pre-trained Initializations. CoRR abs/2306.11903 (2023)
2010 – 2019
- 2019
- [c12]Hanna Mazzawi, Xavi Gonzalvo, Aleks Kracun, Prashant Sridhar, Niranjan Subrahmanya, Ignacio López-Moreno, Hyun-Jin Park, Patrick Violette:
Improving Keyword Spotting and Language Identification via Neural Architecture Search at Scale. INTERSPEECH 2019: 1278-1282 - [i8]Vladimir Macko, Charles Weill, Hanna Mazzawi, Javier Gonzalvo:
Improving Neural Architecture Search Image Classifiers via Ensemble Learning. CoRR abs/1903.06236 (2019) - [i7]Charles Weill, Javier Gonzalvo, Vitaly Kuznetsov, Scott Yang, Scott Yak, Hanna Mazzawi, Eugen Hotaj, Ghassen Jerfel, Vladimir Macko, Ben Adlam, Mehryar Mohri, Corinna Cortes:
AdaNet: A Scalable and Flexible Framework for Automatically Learning Ensembles. CoRR abs/1905.00080 (2019) - [i6]Scott Yak, Javier Gonzalvo, Hanna Mazzawi:
Towards Task and Architecture-Independent Generalization Gap Predictors. CoRR abs/1906.01550 (2019) - 2018
- [j4]Hasan Abasi, Nader H. Bshouty, Hanna Mazzawi:
Non-adaptive learning of a hidden hypergraph. Theor. Comput. Sci. 716: 15-27 (2018) - 2017
- [c11]Hanna Mazzawi, Gal Dalal, David Rozenblat, Liat Ein-Dor, Matan Ninio, Ofer Lavi, Allon Adir, Ehud Aharoni, Einat Kermany:
Anomaly Detection in Large Databases Using Behavioral Patterning. ICDE 2017: 1140-1149 - 2015
- [j3]Nader H. Bshouty, Hanna Mazzawi:
On Parity Check (0, 1)-Matrix over ℤp. SIAM J. Discret. Math. 29(1): 631-657 (2015) - [c10]Hasan Abasi, Nader H. Bshouty, Hanna Mazzawi:
Non-adaptive Learning of a Hidden Hypergraph. ALT 2015: 89-101 - [i5]Hasan Abasi, Nader H. Bshouty, Hanna Mazzawi:
Non-Adaptive Learning a Hidden Hipergraph. CoRR abs/1502.04137 (2015) - 2014
- [c9]Hasan Abasi, Nader H. Bshouty, Hanna Mazzawi:
On Exact Learning Monotone DNF from Membership Queries. ALT 2014: 111-124 - [i4]Hasan Abasi, Nader H. Bshouty, Hanna Mazzawi:
On Exact Learning Monotone DNF from Membership Queries. CoRR abs/1405.0792 (2014) - 2013
- [c8]Einat Kermany, Hanna Mazzawi, Dorit Baras, Yehuda Naveh, Hagai Michaelis:
Analysis of advanced meter infrastructure data of water consumption in apartment buildings. KDD 2013: 1159-1167 - 2012
- [j2]Nader H. Bshouty, Hanna Mazzawi:
Toward a deterministic polynomial time algorithm with optimal additive query complexity. Theor. Comput. Sci. 417: 23-35 (2012) - 2011
- [b1]Hanna Mazzawi:
Reconstructing graphs using edge counting queries. Technion - Israel Institute of Technology, Israel, 2011 - [j1]Nader H. Bshouty, Hanna Mazzawi:
Reconstructing weighted graphs with minimal query complexity. Theor. Comput. Sci. 412(19): 1782-1790 (2011) - [c7]Nader H. Bshouty, Hanna Mazzawi:
On Parity Check (0, 1)-Matrix over Zp. SODA 2011: 1383-1394 - [i3]Nader H. Bshouty, Hanna Mazzawi:
Algorithms for the Coin Weighing Problems with the Presence of Noise. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [c6]Nader H. Bshouty, Hanna Mazzawi:
Toward a Deterministic Polynomial Time Algorithm with Optimal Additive Query Complexity. MFCS 2010: 221-232 - [c5]Hanna Mazzawi:
Optimally Reconstructing Weighted Graphs Using Queries. SODA 2010: 608-615 - [c4]Nader H. Bshouty, Hanna Mazzawi:
Optimal Query Complexity for Reconstructing Hypergraphs. STACS 2010: 143-154 - [i2]Nader H. Bshouty, Hanna Mazzawi:
Optimal Query Complexity for Reconstructing Hypergraphs. CoRR abs/1001.0405 (2010)
2000 – 2009
- 2009
- [c3]Nader H. Bshouty, Hanna Mazzawi:
Reconstructing Weighted Graphs with Minimal Query Complexity. ALT 2009: 97-109 - [i1]Hanna Mazzawi, Nader H. Bshouty:
On Parity Check (0, 1)-Matrix over Zp. Electron. Colloquium Comput. Complex. TR09 (2009) - 2006
- [c2]Laurence Bisht, Nader H. Bshouty, Hanna Mazzawi:
On Optimal Learning Algorithms for Multiplicity Automata. COLT 2006: 184-198 - [c1]Nader H. Bshouty, Hanna Mazzawi:
Exact Learning Composed Classes with a Small Number of Mistakes. COLT 2006: 199-213
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:
