default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZvika Ben-Haim
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c4]Niv Giladi, Zvika Ben-Haim, Sella Nevo, Yossi Matias, Daniel Soudry:
Physics-Aware Downsampling with Deep Learning for Scalable Flood Modeling. NeurIPS 2021: 1378-1389- [i11]Niv Giladi, Zvika Ben-Haim, Sella Nevo, Yossi Matias, Daniel Soudry:
Physics-Aware Downsampling with Deep Learning for Scalable Flood Modeling. CoRR abs/2106.07218 (2021) - [i10]Sella Nevo, Efrat Morin, Adi Gerzi Rosenthal, Asher Metzger, Chen Barshai, Dana Weitzner, Dafi Voloshin, Frederik Kratzert, Gal Elidan, Gideon Dror, Gregory Begelman, Grey Nearing, Guy Shalev, Hila Noga, Ira Shavitt, Liora Yuklea, Moriah Royz, Niv Giladi, Nofar Peled Levi, Ofir Reich, Oren Gilon, Ronnie Maor, Shahar Timnat, Tal Shechter, Vladimir Anisimov, Yotam Gigi, Yuval Levin, Zach Moshe, Zvika Ben-Haim, Avinatan Hassidim, Yossi Matias:
Flood forecasting with machine learning models in an operational framework. CoRR abs/2111.02780 (2021)
2010 – 2019
- 2019
- [i9]Zvika Ben-Haim, Vladimir Anisimov, Aaron Yonas, Varun Gulshan, Yusef Shafi, Stephan Hoyer, Sella Nevo:
Inundation Modeling in Data Scarce Regions. CoRR abs/1910.05006 (2019) - 2014
- [j11]Alexander Jung
, Sebastian Schmutzhard, Franz Hlawatsch, Zvika Ben-Haim, Yonina C. Eldar:
Minimum Variance Estimation of a Sparse Vector Within the Linear Gaussian Model: An RKHS Approach. IEEE Trans. Inf. Theory 60(10): 6555-6575 (2014) - 2013
- [i8]Alexander Jung, Sebastian Schmutzhard, Franz Hlawatsch, Zvika Ben-Haim, Yonina C. Eldar:
Minimum Variance Estimation of a Sparse Vector within the Linear Gaussian Model: An RKHS Approach. CoRR abs/1304.3886 (2013) - 2012
- [j10]Zvika Ben-Haim, Tomer Michaeli, Yonina C. Eldar:
Performance Bounds and Design Criteria for Estimating Finite Rate of Innovation Signals. IEEE Trans. Inf. Theory 58(8): 4993-5015 (2012) - [p1]Jose Antonio Urigüen, Yonina C. Eldar, Pier Luigi Dragotti, Zvika Ben-Haim:
Sampling at the rate of innovation: theory and applications. Compressed Sensing 2012: 148-209 - 2011
- [j9]Zvika Ben-Haim, Yonina C. Eldar:
Near-Oracle Performance of Greedy Block-Sparse Estimation Techniques From Noisy Measurements. IEEE J. Sel. Top. Signal Process. 5(5): 1032-1047 (2011) - [j8]Alexander Jung, Zvika Ben-Haim, Franz Hlawatsch, Yonina C. Eldar:
Unbiased Estimation of a Sparse Vector in White Gaussian Noise. IEEE Trans. Inf. Theory 57(12): 7856-7876 (2011) - 2010
- [j7]Zvika Ben-Haim, Yonina C. Eldar:
The Cramér-Rao bound for estimating a sparse parameter vector. IEEE Trans. Signal Process. 58(6): 3384-3389 (2010) - [j6]Zvika Ben-Haim, Yonina C. Eldar, Michael Elad:
Coherence-based performance guarantees for estimating a sparse vector under random noise. IEEE Trans. Signal Process. 58(10): 5030-5043 (2010) - [c3]Zvika Ben-Haim, Yonina C. Eldar, Michael Elad:
Coherence-based near-oracle performance guarantees for sparse estimation under Gaussian noise. ICASSP 2010: 3590-3593 - [c2]Alexander Jung, Zvika Ben-Haim, Franz Hlawatsch, Yonina C. Eldar:
On unbiased estimation of sparse vectors corrupted by Gaussian noise. ICASSP 2010: 3990-3993 - [i7]Alexander Jung, Zvika Ben-Haim, Franz Hlawatsch, Yonina C. Eldar:
On Unbiased Estimation of Sparse Vectors Corrupted by Gaussian Noise. CoRR abs/1002.0110 (2010) - [i6]Alexander Jung, Zvika Ben-Haim, Franz Hlawatsch, Yonina C. Eldar:
Unbiased Estimation of a Sparse Vector in White Gaussian Noise. CoRR abs/1005.5697 (2010) - [i5]Zvika Ben-Haim, Yonina C. Eldar:
Near-Oracle Performance of Greedy Block-Sparse Estimation Techniques from Noisy Measurements. CoRR abs/1009.0906 (2010) - [i4]Zvika Ben-Haim, Tomer Michaeli, Yonina C. Eldar:
Performance Bounds and Design Criteria for Estimating Finite Rate of Innovation Signals. CoRR abs/1009.2221 (2010) - [i3]Sebastian Schmutzhard, Alexander Jung, Franz Hlawatsch, Zvika Ben-Haim, Yonina C. Eldar:
A Lower Bound on the Estimator Variance for the Sparse Linear Model. CoRR abs/1009.3353 (2010)
2000 – 2009
- 2009
- [j5]Zvika Ben-Haim, Yonina C. Eldar:
On the Constrained CramÉr-Rao Bound With a Singular Fisher Information Matrix. IEEE Signal Process. Lett. 16(6): 453-456 (2009) - [j4]Zvika Ben-Haim, Yonina C. Eldar:
A lower bound on the Bayesian MSE based on the optimal bias function. IEEE Trans. Inf. Theory 55(11): 5179-5196 (2009) - [i2]Zvika Ben-Haim, Yonina C. Eldar:
The Cramer-Rao Bound for Sparse Estimation. CoRR abs/0905.4378 (2009) - 2008
- [j3]Zvika Ben-Haim, Yonina C. Eldar:
A Comment on the Weiss-Weinstein Bound for Constrained Parameter Sets. IEEE Trans. Inf. Theory 54(10): 4682-4684 (2008) - [i1]Zvika Ben-Haim, Yonina C. Eldar:
A Lower Bound on the Bayesian MSE Based on the Optimal Bias Function. CoRR abs/0804.4391 (2008) - 2007
- [j2]Zvika Ben-Haim, Yonina C. Eldar:
Blind Minimax Estimation. IEEE Trans. Inf. Theory 53(9): 3145-3157 (2007) - 2005
- [j1]Zvika Ben-Haim, Yonina C. Eldar:
Maximum set estimators with bounded estimation error. IEEE Trans. Signal Process. 53(8-2): 3172-3182 (2005) - [c1]Zvika Ben-Haim, Yonina C. Eldar:
Minimax estimators dominating the least-squares estimator. ICASSP (4) 2005: 53-56
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-04-25 05:56 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:
