default search action
Hanzhang Hu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j12]Chuanjun Chen, Yuzhi Lou, Hanzhang Hu:
Two-grid finite volume element method for the time-dependent Schrödinger equation. Comput. Math. Appl. 108: 185-195 (2022) - [j11]Hanzhang Hu, Buyang Li, Jun Zou:
Optimal Convergence of the Newton Iterative Crank-Nicolson Finite Element Method for the Nonlinear Schrödinger Equation. Comput. Methods Appl. Math. 22(3): 591-612 (2022) - [j10]Hanzhang Hu
:
Two-grid method for compressible miscible displacement problem by mixed finite element methods and expanded mixed finite element method of characteristics. Numer. Algorithms 89(2): 611-636 (2022) - 2021
- [j9]Hanzhang Hu, Yanping Chen
Analysis of finite element two-grid algorithms for two-dimensional nonlinear Schrödinger equation with wave operator. J. Comput. Appl. Math. 397: 113647 (2021) - 2020
- [j8]Hanzhang Hu, Yanping Chen
A characteristic finite element two-grid algorithm for a compressible miscible displacement problem. Adv. Comput. Math. 46(2): 15 (2020) - [j7]Hanzhang Hu
Numerical solution of two-dimensional nonlinear Schrödinger equation using a new two-grid finite element method. J. Comput. Appl. Math. 364 (2020) - [j6]Hanzhang Hu
A two-grid method for characteristic expanded mixed finite element solution of miscible displacement problem. Numer. Linear Algebra Appl. 27(3) (2020)
2010 – 2019
- 2019
- [b1]Hanzhang Hu:
Anytime Prediction and Learning for the Balance between Computation and Accuracy. Carnegie Mellon University, USA, 2019 - [j5]Xiulian Shi
Convergence analysis of spectral methods for high-order nonlinear Volterra integro-differential equations. Comput. Appl. Math. 38(2) (2019) - [j4]Hanzhang Hu, Yiping Fu, Jie Zhou:
Numerical solution of a miscible displacement problem with dispersion term using a two-grid mixed finite element approach. Numer. Algorithms 81(3): 879-914 (2019) - [c5]Hanzhang Hu, Debadeepta Dey, Martial Hebert, J. Andrew Bagnell:
Learning Anytime Predictions in Neural Networks via Adaptive Loss Balancing. AAAI 2019: 3812-3821 - [c4]Hanzhang Hu, John Langford, Rich Caruana, Saurajit Mukherjee, Eric Horvitz, Debadeepta Dey:
Efficient Forward Architecture Search. NeurIPS 2019: 10122-10131 - [i5]Hanzhang Hu, John Langford, Rich Caruana, Saurajit Mukherjee, Eric Horvitz, Debadeepta Dey:
Efficient Forward Architecture Search. CoRR abs/1905.13360 (2019) - 2018
- [j3]Hanzhang Hu
Two-grid method for two-dimensional nonlinear Schrödinger equation by mixed finite element method. Comput. Math. Appl. 75(3): 900-917 (2018) - [j2]Jiaoyan Zeng, Yanping Chen
Two-grid method for compressible miscible displacement problem by CFEM-MFEM. J. Comput. Appl. Math. 337: 175-189 (2018) - 2017
- [c3]Hanzhang Hu, Wen Sun, Arun Venkatraman, Martial Hebert, J. Andrew Bagnell:
Gradient Boosting on Stochastic Data Streams. AISTATS 2017: 595-603 - [i4]Hanzhang Hu, Wen Sun, Arun Venkatraman, Martial Hebert, J. Andrew Bagnell:
Gradient Boosting on Stochastic Data Streams. CoRR abs/1703.00377 (2017) - [i3]Hanzhang Hu, Debadeepta Dey, J. Andrew Bagnell, Martial Hebert:
Anytime Neural Networks via Joint Optimization of Auxiliary Losses. CoRR abs/1708.06832 (2017) - [i2]Hanzhang Hu, Debadeepta Dey, Allison Del Giorno, Martial Hebert, J. Andrew Bagnell:
Log-DenseNet: How to Sparsify a DenseNet. CoRR abs/1711.00002 (2017) - 2016
- [j1]Hanzhang Hu, Yanping Chen
Two-grid method for miscible displacement problem by mixed finite element methods and finite element method of characteristics. Comput. Math. Appl. 72(11): 2694-2715 (2016) - [c2]Hanzhang Hu, Alexander Grubb, J. Andrew Bagnell, Martial Hebert:
Efficient Feature Group Sequencing for Anytime Linear Prediction. UAI 2016 - 2014
- [i1]Hanzhang Hu, Alexander Grubb, J. Andrew Bagnell, Martial Hebert:
Efficient Feature Group Sequencing for Anytime Linear Prediction. CoRR abs/1409.5495 (2014) - 2013
- [c1]Hanzhang Hu, Daniel Munoz, J. Andrew Bagnell, Martial Hebert:
Efficient 3-D scene analysis from streaming data. ICRA 2013: 2297-2304
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-05-08 20:58 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: