![](https://dblp.uni-trier.de./img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de./img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de./img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Jan Hannig
Person information
Refine list
![note](https://dblp.uni-trier.de./img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j18]Xi Yang, Jan Hannig
, Katherine A. Hoadley, Iain Carmichael
, J. S. Marron:
Measure of Strength of Evidence for Visually Observed Differences between Subpopulations. J. Comput. Graph. Stat. 33(2): 736-748 (2024) - 2023
- [j17]Xi Yang, Katherine A. Hoadley, Jan Hannig
, J. S. Marron:
Jackstraw inference for AJIVE data integration. Comput. Stat. Data Anal. 180: 107649 (2023) - 2022
- [j16]Taylor Petty
, Jan Hannig
, Tunde I. Huszar
, Hari Iyer:
A New String Edit Distance and Applications. Algorithms 15(7): 242 (2022) - [j15]Suofei Wu, Jan Hannig
, Thomas C. M. Lee:
Uncertainty quantification for honest regression trees. Comput. Stat. Data Anal. 167: 107377 (2022) - [j14]Yi Su, Jan Hannig, Thomas C. M. Lee
:
Uncertainty Quantification in Graphon Estimation Using Generalized Fiducial Inference. IEEE Trans. Signal Inf. Process. over Networks 8: 597-609 (2022) - 2021
- [j13]Shevaun D. Neupert
, Claire M. Growney, Xianghe Zhu
, Julia K. Sorensen, Emily L. Smith
, Jan Hannig
:
BFF: Bayesian, Fiducial, and Frequentist Analysis of Cognitive Engagement among Cognitively Impaired Older Adults. Entropy 23(4): 428 (2021) - [j12]Randy C. S. Lai, Jan Hannig
, Thomas C. M. Lee
:
Method G: Uncertainty Quantification for Distributed Data Problems Using Generalized Fiducial Inference. J. Comput. Graph. Stat. 30(4): 934-945 (2021) - [j11]Weiwei Li, Jan Hannig, Sayan Mukherjee:
Subspace Clustering through Sub-Clusters. J. Mach. Learn. Res. 22: 53:1-53:37 (2021)
2010 – 2019
- 2019
- [i4]Weiwei Li, Jan Hannig, Corbin Jones:
A Note on Optimal Sampling Strategy for Structural Variant Detection Using Optical Mapping. CoRR abs/1910.04067 (2019) - 2018
- [j10]Qing Feng, Meilei Jiang, Jan Hannig
, J. S. Marron:
Angle-based joint and individual variation explained. J. Multivar. Anal. 166: 241-265 (2018) - [j9]Sergio A. Almada Monter
, Amarjit Budhiraja, Jan Hannig:
Source Detection Algorithms for Dynamic Contaminants Based on the Analysis of a Hydrodynamic Limit. SIAM J. Appl. Math. 78(5): 2279-2297 (2018) - [i3]Weiwei Li, Jan Hannig, Sayan Mukherjee:
Subspace Clustering through Sub-Clusters. CoRR abs/1811.06580 (2018) - 2016
- [j8]Xuhua Liu, Xingzhong Xu, Jan Hannig:
Least squares generalized inferences in unbalanced two-component normal mixed linear model. Comput. Stat. 31(3): 973-988 (2016) - 2015
- [i2]Sergio A. Almada Monter, Amarjit Budhiraja, Jan Hannig:
Source detection algorithms for dynamic contaminants based on the analysis of a hydrodynamic limit. CoRR abs/1510.05193 (2015) - 2014
- [j7]Jan Hannig, Randy C. S. Lai, Thomas C. M. Lee:
Computational issues of generalized fiducial inference. Comput. Stat. Data Anal. 71: 849-858 (2014) - [j6]Petro Borysov, Jan Hannig, J. S. Marron:
Asymptotics of hierarchical clustering for growing dimension. J. Multivar. Anal. 124: 465-479 (2014) - 2013
- [j5]Yang Zhang, Edwin K. P. Chong, Jan Hannig, Donald J. Estep:
Approximating Extremely Large Networks via Continuum Limits. IEEE Access 1: 577-595 (2013) - 2011
- [j4]Damian V. Wandler, Jan Hannig:
Fiducial inference on the largest mean of a multivariate normal distribution. J. Multivar. Anal. 102(1): 87-104 (2011) - [c3]Yang Zhang, Edwin K. P. Chong
, Jan Hannig, Donald J. Estep:
Continuum modeling and control of large nonuniform networks. Allerton 2011: 1670-1677 - [r1]Jan Hannig, Hari Iyer, Thomas C. M. Lee:
Fiducial Inference. International Encyclopedia of Statistical Science 2011: 515-519 - [i1]Yang Zhang, Edwin K. P. Chong, Jan Hannig, Donald J. Estep:
Continuum Limits of Markov Chains with Application to Network Modeling. CoRR abs/1106.4288 (2011) - 2010
- [c2]Yang Zhang, Edwin K. P. Chong
, Jan Hannig, Donald J. Estep:
On continuum limits of Markov chains and network modeling. CDC 2010: 6779-6784
2000 – 2009
- 2008
- [j3]Hua Li, Patricia R. Barbosa, Edwin K. P. Chong
, Jan Hannig, Sanjeev R. Kulkarni:
Zero-error target tracking with limited communication. IEEE J. Sel. Areas Commun. 26(4): 686-694 (2008) - 2006
- [j2]Jan Hannig, Edwin K. P. Chong
, Sanjeev R. Kulkarni:
Relative Frequencies of Generalized Simulated Annealing. Math. Oper. Res. 31(1): 199-216 (2006) - 2005
- [c1]Jan Hannig, Edwin K. P. Chong
, Sanjeev R. Kulkarni:
Relative Frequencies of Non-homogeneous Markov Chains in Simulated Annealing and Related Algorithms. CDC/ECC 2005: 6626-6631 - 2004
- [j1]Jan Hannig, Thomas C. M. Lee:
Kernel smoothing of periodograms under Kullback-Leibler discrepancy. Signal Process. 84(7): 1255-1266 (2004)
Coauthor Index
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
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-07-20 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint