default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeixin Ye
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j31]Wan Li, Peixin Ye:
Sparse Signal Recovery via Rescaled Matching Pursuit. Axioms 13(5): 288 (2024)- 2023
- [j30]Yu-Jie Liu, Wentao Cheng
, Wen-Hui Zhang, Pei-Xin Ye:
Approximation Properties of the Blending-Type Bernstein-Durrmeyer Operators. Axioms 12(1): 5 (2023) - [j29]Chunfang Shao, Xiujie Wei, Peixin Ye, Shuo Xing:
Efficiency of Orthogonal Matching Pursuit for Group Sparse Recovery. Axioms 12(4): 389 (2023) - [j28]Hongcheng Huang, Peixin Ye, Min Hu, Jun Wu:
A multi-point collaborative DDoS defense mechanism for IIoT environment. Digit. Commun. Networks 9(2): 590-601 (2023) - [j27]Wenhui Zhang, Peixin Ye, Shuo Xing:
Optimality of the rescaled pure greedy learning algorithms. Int. J. Wavelets Multiresolution Inf. Process. 21(2): 2250048:1-2250048:22 (2023) - 2022
- [j26]Chunfang Shao, Jincai Chang, Peixin Ye, Wenhui Zhang, Shuo Xing:
Almost Optimality of the Orthogonal Super Greedy Algorithm for μ-Coherent Dictionaries. Axioms 11(5): 186 (2022) - [j25]Wenhui Zhang, Peixin Ye, Shuo Xing, Xu Xu:
Optimality of the Approximation and Learning by the Rescaled Pure Super Greedy Algorithms. Axioms 11(9): 437 (2022) - [j24]Bing Jiang, Peixin Ye, Wenhui Zhang:
Unified error estimate for weak biorthogonal Greedy algorithms. Int. J. Wavelets Multiresolution Inf. Process. 20(5): 2250010:1-2250010:15 (2022) - 2021
- [j23]Bing Jiang, Peixin Ye:
Efficiency of the weak Rescaled Pure Greedy Algorithm. Int. J. Wavelets Multiresolution Inf. Process. 19(4): 2150001:1-2150001:20 (2021) - 2020
- [j22]Qin Guo, Peixin Ye:
Error analysis of the moving least-squares regression learning algorithm with β-mixing and non-identical sampling. Int. J. Comput. Math. 97(8): 1586-1602 (2020) - [j21]Liqin Duan, Peixin Ye:
Randomized approximation numbers on Besov classes with mixed smoothness. Int. J. Wavelets Multiresolution Inf. Process. 18(4): 2050023:1-2050023:19 (2020)
2010 – 2019
- 2019
- [j20]Qin Guo, Peixin Ye:
Error analysis of the moving least-squares method with non-identical sampling. Int. J. Comput. Math. 96(4): 767-781 (2019) - 2018
- [j19]Qin Guo, Peixin Ye, Binlei Cai:
Convergence Rate for lq-Coefficient Regularized Regression With Non-i.i.d. Sampling. IEEE Access 6: 18804-18813 (2018) - [j18]Qin Guo, Peixin Ye:
Error Analysis of Least-Squares lq-Regularized Regression Learning Algorithm With the Non-Identical and Dependent Samples. IEEE Access 6: 43824-43829 (2018) - [j17]Qin Guo, Cheng Wang, Peixin Ye:
Coefficient-based lq-regularized regression with indefinite kernels and unbounded sampling. J. Approx. Theory 236: 1-22 (2018) - 2017
- [j16]Chunfang Shao, Peixin Ye:
Almost optimality of orthogonal super greedy algorithms for incoherent dictionaries. Int. J. Wavelets Multiresolution Inf. Process. 15(4): 1750029:1-1750029:16 (2017) - [j15]Huanxiang Liu, Baohuai Sheng, Peixin Ye:
The improved learning rate for regularized regression with RKBSs. Int. J. Mach. Learn. Cybern. 8(4): 1235-1245 (2017) - 2016
- [j14]Qin Guo, Peixin Ye:
Coefficient-based regularized regression with dependent and unbounded sampling. Int. J. Wavelets Multiresolution Inf. Process. 14(5): 1650039:1-1650039:14 (2016) - 2015
- [j13]Baohuai Sheng, Daohong Xiang, Peixin Ye:
Convergence rate of semi-supervised gradient learning algorithms. Int. J. Wavelets Multiresolution Inf. Process. 13(4): 1550021:1-1550021:26 (2015) - [j12]Peixin Ye, Xiujie Wei:
The efficiency of using Orthogonal Matching Pursuit in compressed sensing. J. Comput. Methods Sci. Eng. 15(3): 459-466 (2015) - [j11]Xiujie Wei, Peixin Ye:
Improved bounds on restricted isometry constant for orthogonal multi matching pursuit. J. Comput. Methods Sci. Eng. 15(4): 737-744 (2015) - 2014
- [j10]Baohuai Sheng, Liqin Duan, Pei-Xin Ye:
Strong Convex Loss Can Increase the Learning Rates of Online Learning. J. Comput. 9(7): 1606-1611 (2014) - 2013
- [c14]Jingfan Long, Xiujie Wei, Peixin Ye:
Optimal error for Orthogonal Matching Pursuit for μ-coherent dictionaries. ICNC 2013: 1408-1413 - 2012
- [j9]Pei-Xin Ye, Baohuai Sheng, Xiuhua Yuan:
Optimal order of truncation and aliasing errors for multi-dimensional Whittaker-Shannon sampling expansion. Int. J. Wirel. Mob. Comput. 5(4): 327-333 (2012) - [j8]Baohuai Sheng, Pei-Xin Ye:
Learning Rates of Support Vector Machine Classifiers with Data Dependent Hypothesis Spaces. J. Comput. 7(1): 252-257 (2012) - 2011
- [j7]Vladimir N. Temlyakov, Mingrui Yang, Peixin Ye:
Greedy approximation with regard to non-greedy bases. Adv. Comput. Math. 34(3): 319-337 (2011) - [j6]Baohuai Sheng, Pei-Xin Ye:
Least Square Regression Learning with Data Dependent Hypothesis and Coefficient Regularzation. J. Comput. 6(4): 671-675 (2011) - [j5]Zhanjie Song, Peixin Ye:
Inverse Estimates for Lupas-Baskakov Operators. J. Comput. 6(12): 2700-2705 (2011) - [c13]Peixin Ye:
Quadrature formula for some classes of analytic functions. EMEIT 2011: 797-799 - 2010
- [c12]Jingfan Long, Sheng Zhang, Peixin Ye:
Convergence rate of quantum algorithm for multivariate approximation. ICNC 2010: 210-214 - [c11]Sheng Zhang, Peixin Ye, Jingfan Long:
Monte Carlo integration with small random bits. ICNC 2010: 2980-2983
2000 – 2009
- 2008
- [j4]Peixin Ye, Xiaofei Hu:
Optimal integration error on anisotropic classes for restricted Monte Carlo and quantum algorithms. J. Approx. Theory 150(1): 24-47 (2008) - [c10]Peixin Ye, Qing He:
Restricted Monte Carlo Integration on Some Multivariate Functions. CSSE (1) 2008: 481-484 - [c9]Peixin Ye:
Quantum Approximation on Some Classes of Multivarite Functions. CSSE (1) 2008: 485-488 - [c8]Peixin Ye, Zhiyong Zhao:
An Adaptive Algorithm in m-Term Approximation for Some Multivariate Functions. CSSE (1) 2008: 489-492 - [c7]Peixin Ye, Qing He:
Complexity of Functional Learning on Some Classes of Multivariate Functions. ICNC (3) 2008: 141-144 - [c6]Peixin Ye:
Lower Bound for Quantum Integration Error on Some Sobolev Classes. ICNC (3) 2008: 642-646 - [c5]Peixin Ye:
Quantum Complexity of the Approximation on the Classes B(Wrp([0, 1]d)) and B(Hrp([0, 1]d)). ICNC (3) 2008: 667-671 - 2007
- [c4]Peixin Ye, Qing He:
Quantum Integration Error on Some Classes of Multivariate Functions. ICIC (3) 2007: 459-468 - [c3]Peixin Ye, Qing He:
An Greedy-type Algorithm in m-term Approximation For Besov Class with Mixed Smoothness. ICNC (1) 2007: 69-73 - [c2]Peixin Ye:
Quantum Approximation Error on Some Sobolev Classes. ICNC (4) 2007: 603-607 - 2006
- [c1]Peixin Ye, Xiaofei Hu:
Quantum Integration Error for Some Sobolev Classes. ICNC (2) 2006: 10-19 - 2005
- [j3]Peixin Ye:
Computational complexity of the integration problem for anisotropic classes. Adv. Comput. Math. 23(4): 375-392 (2005) - 2003
- [j2]Gensun Fang, Peixin Ye:
Probabilistic and average linear widths of Sobolev space with Gaussian measure. J. Complex. 19(1): 73-84 (2003) - [j1]Gensun Fang, Peixin Ye:
Integration error for multivariate functions from anisotropic classes . J. Complex. 19(4): 610-627 (2003)
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-07-27 17:33 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:
