![](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
Computational Statistics & Data Analysis, Volume 190
Volume 190, February 2024
- Ming-Hung Kao, Ping-Han Huang:
Hybrid exact-approximate design approach for sparse functional data. 107850 - Antoine Godichon-Baggioni, Wei Lu
, Bruno Portier:
Recursive ridge regression using second-order stochastic algorithms. 107854
- Qiuyan Zhang
, Chen Wang, Baoxue Zhang, Hu Yang
:
An RIHT statistic for testing the equality of several high-dimensional mean vectors under homoskedasticity. 107855 - Wenbiao Zhao, Lixing Zhu:
Detecting change structures of nonparametric regressions. 107856
- Mateus Maia
, Keefe Murphy, Andrew C. Parnell
:
GP-BART: A novel Bayesian additive regression trees approach using Gaussian processes. 107858
- Lili Yu
, Yichuan Zhao:
Laplace approximated quasi-likelihood method for heteroscedastic survival data. 107859 - Tonglin Zhang
:
Variables selection using L0 penalty. 107860 - Wataru Yoshida
, Kei Hirose
:
Fast same-step forecast in SUTSE model and its theoretical properties. 107861 - Xichen Mou
, Dewei Wang:
Additive partially linear model for pooled biomonitoring data. 107862 - Wei Li, Shanshan Luo, Wangli Xu
:
Calibrated regression estimation using empirical likelihood under data fusion. 107871
- Xiao Guo, Hai Zhang, Xiangyu Chang:
On the efficacy of higher-order spectral clustering under weighted stochastic block models. 107872
![](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.