Статті в журналах з теми "Sparse bound"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 статей у журналах для дослідження на тему "Sparse bound".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.
Lorist, Emiel, and Zoe Nieraeth. "Sparse domination implies vector-valued sparse domination." Mathematische Zeitschrift 301, no. 1 (January 12, 2022): 1–35. http://dx.doi.org/10.1007/s00209-021-02943-z.
Повний текст джерелаShparlinski, Igor E., and José Felipe Voloch. "Value Sets of Sparse Polynomials." Canadian Mathematical Bulletin 63, no. 1 (September 24, 2019): 187–96. http://dx.doi.org/10.4153/s0008439519000316.
Повний текст джерелаZhang, Rui, Rui Xin, Margo Seltzer, and Cynthia Rudin. "Optimal Sparse Regression Trees." Proceedings of the AAAI Conference on Artificial Intelligence 37, no. 9 (June 26, 2023): 11270–79. http://dx.doi.org/10.1609/aaai.v37i9.26334.
Повний текст джерелаChen, Wengu, and Huanmin Ge. "A Sharp Bound on RIC in Generalized Orthogonal Matching Pursuit." Canadian Mathematical Bulletin 61, no. 1 (March 1, 2018): 40–54. http://dx.doi.org/10.4153/cmb-2017-009-6.
Повний текст джерелаFerber, Asaf, Gweneth McKinley, and Wojciech Samotij. "Supersaturated Sparse Graphs and Hypergraphs." International Mathematics Research Notices 2020, no. 2 (March 8, 2018): 378–402. http://dx.doi.org/10.1093/imrn/rny030.
Повний текст джерелаFELDHEIM, OHAD N., and MICHAEL KRIVELEVICH. "Winning Fast in Sparse Graph Construction Games." Combinatorics, Probability and Computing 17, no. 6 (November 2008): 781–91. http://dx.doi.org/10.1017/s0963548308009401.
Повний текст джерелаChen, Qiushi, Xin Zhang, Qiang Yang, Lei Ye, and Mengxiao Zhao. "Performance Bound for Joint Multiple Parameter Target Estimation in Sparse Stepped-Frequency Radar: A Comparison Analysis." Sensors 19, no. 9 (April 29, 2019): 2002. http://dx.doi.org/10.3390/s19092002.
Повний текст джерелаSapir, Shachar, and Asaf Shapira. "The Induced Removal Lemma in Sparse Graphs." Combinatorics, Probability and Computing 29, no. 1 (September 30, 2019): 153–62. http://dx.doi.org/10.1017/s0963548319000233.
Повний текст джерелаDeng, Hao, Jianghong Chen, Biqin Song, and Zhibin Pan. "Error Bound of Mode-Based Additive Models." Entropy 23, no. 6 (May 22, 2021): 651. http://dx.doi.org/10.3390/e23060651.
Повний текст джерелаMilani Fard, Mahdi, Yuri Grinberg, Joelle Pineau, and Doina Precup. "Compressed Least-Squares Regression on Sparse Spaces." Proceedings of the AAAI Conference on Artificial Intelligence 26, no. 1 (September 20, 2021): 1054–60. http://dx.doi.org/10.1609/aaai.v26i1.8303.
Повний текст джерелаGirolami, Mark. "A Variational Method for Learning Sparse and Overcomplete Representations." Neural Computation 13, no. 11 (November 1, 2001): 2517–32. http://dx.doi.org/10.1162/089976601753196003.
Повний текст джерелаWang, Gang, Min-Yao Niu, and You Gao. "Welch bound-achieving compressed sensing matrices from optimal codebooks." Discrete Mathematics, Algorithms and Applications 12, no. 03 (May 26, 2020): 2050042. http://dx.doi.org/10.1142/s1793830920500421.
Повний текст джерелаDallaporta, Sandrine, and Yohann De Castro. "Sparse recovery from extreme eigenvalues deviation inequalities." ESAIM: Probability and Statistics 23 (2019): 430–63. http://dx.doi.org/10.1051/ps/2018024.
Повний текст джерелаMcTavish, Hayden, Chudi Zhong, Reto Achermann, Ilias Karimalis, Jacques Chen, Cynthia Rudin, and Margo Seltzer. "Fast Sparse Decision Tree Optimization via Reference Ensembles." Proceedings of the AAAI Conference on Artificial Intelligence 36, no. 9 (June 28, 2022): 9604–13. http://dx.doi.org/10.1609/aaai.v36i9.21194.
Повний текст джерелаFeng, Xue, Shi Yan та Chunlin Wu. "The ℓ2, regularized group sparse optimization: Lower bound theory, recovery bound and algorithms". Applied and Computational Harmonic Analysis 49, № 2 (вересень 2020): 381–414. http://dx.doi.org/10.1016/j.acha.2020.04.002.
Повний текст джерелаBerg, Mark de, Dan Halperin, Mark Overmars, and Marc van Kreveld. "Sparse Arrangements and the Number of Views of Polyhedral Scenes." International Journal of Computational Geometry & Applications 07, no. 03 (June 1997): 175–95. http://dx.doi.org/10.1142/s0218195997000120.
Повний текст джерелаBERTRAM-KRETZBERG, CLAUDIA, THOMAS HOFMEISTER, and HANNO LEFMANN. "Sparse 0−1 Matrices and Forbidden Hypergraphs." Combinatorics, Probability and Computing 8, no. 5 (September 1999): 417–27. http://dx.doi.org/10.1017/s0963548399004058.
Повний текст джерелаHan, Zhi, Jianjun Wang, Jia Jing, and Hai Zhang. "A Simple Gaussian Measurement Bound for Exact Recovery of Block-Sparse Signals." Discrete Dynamics in Nature and Society 2014 (2014): 1–8. http://dx.doi.org/10.1155/2014/104709.
Повний текст джерелаSmith, Andrew Paul. "Fast construction of constant bound functions for sparse polynomials." Journal of Global Optimization 43, no. 2-3 (July 31, 2007): 445–58. http://dx.doi.org/10.1007/s10898-007-9195-4.
Повний текст джерелаBjarnason, Ronald, Alan Fern, and Prasad Tadepalli. "Lower Bounding Klondike Solitaire with Monte-Carlo Planning." Proceedings of the International Conference on Automated Planning and Scheduling 19 (October 16, 2009): 26–33. http://dx.doi.org/10.1609/icaps.v19i1.13363.
Повний текст джерелаKim, Jeong Han. "On Brooks' Theorem for Sparse Graphs." Combinatorics, Probability and Computing 4, no. 2 (June 1995): 97–132. http://dx.doi.org/10.1017/s0963548300001528.
Повний текст джерелаLiu, Tongliang, Dacheng Tao, and Dong Xu. "Dimensionality-Dependent Generalization Bounds for k-Dimensional Coding Schemes." Neural Computation 28, no. 10 (October 2016): 2213–49. http://dx.doi.org/10.1162/neco_a_00872.
Повний текст джерелаLi, Zelin, Changli Yao, Yuanman Zheng, Junheng Wang, and Yuwen Zhang. "3D magnetic sparse inversion using an interior-point method." GEOPHYSICS 83, no. 3 (May 1, 2018): J15—J32. http://dx.doi.org/10.1190/geo2016-0652.1.
Повний текст джерелаBen-Haim, Zvika, and Yonina C. Eldar. "The Cramér-Rao Bound for Estimating a Sparse Parameter Vector." IEEE Transactions on Signal Processing 58, no. 6 (June 2010): 3384–89. http://dx.doi.org/10.1109/tsp.2010.2045423.
Повний текст джерелаWu, Bo, Bo Huang, and Liangpei Zhang. "An Error-Bound-Regularized Sparse Coding for Spatiotemporal Reflectance Fusion." IEEE Transactions on Geoscience and Remote Sensing 53, no. 12 (December 2015): 6791–803. http://dx.doi.org/10.1109/tgrs.2015.2448100.
Повний текст джерелаCui, Yunjiang, Jun Ming, Xinlei Shi, Wangwang Yang, Zhansong Zhang, and Chong Zhang. "A New Method for Calculating Reservoir Core-Bound Water Saturation Using the Cast Thin Section." Processes 11, no. 5 (May 5, 2023): 1397. http://dx.doi.org/10.3390/pr11051397.
Повний текст джерелаKelley, Zander. "Roots of sparse polynomials over a finite field." LMS Journal of Computation and Mathematics 19, A (2016): 196–204. http://dx.doi.org/10.1112/s1461157016000334.
Повний текст джерелаBanihashem, Kiarash, Mohammad Hajiaghayi, and Max Springer. "Optimal Sparse Recovery with Decision Stumps." Proceedings of the AAAI Conference on Artificial Intelligence 37, no. 6 (June 26, 2023): 6745–52. http://dx.doi.org/10.1609/aaai.v37i6.25827.
Повний текст джерелаZaidel, Benjamin M., Ori Shental, and Shlomo Shamai (Shitz). "Beyond Equal-Power Sparse NOMA: Two User Classes and Closed-Form Bounds on the Achievable Region." Entropy 24, no. 2 (January 31, 2022): 227. http://dx.doi.org/10.3390/e24020227.
Повний текст джерелаBu, Yuehua, and Chentao Qi. "Injective edge coloring of sparse graphs." Discrete Mathematics, Algorithms and Applications 10, no. 02 (April 2018): 1850022. http://dx.doi.org/10.1142/s1793830918500222.
Повний текст джерелаArunachalam, Srinivasan, Sourav Chakraborty, Troy Lee, Manaswi Paraashar, and Ronald de Wolf. "Two new results about quantum exact learning." Quantum 5 (November 24, 2021): 587. http://dx.doi.org/10.22331/q-2021-11-24-587.
Повний текст джерелаNigam, H. K., and Saroj Yadav. "Sparse recovery for compressive sensing via weighted Lp−q model." Filomat 36, no. 14 (2022): 4709–16. http://dx.doi.org/10.2298/fil2214709n.
Повний текст джерелаKABANAVA, M., H. RAUHUT та H. ZHANG. "Robust analysis ℓ1-recovery from Gaussian measurements and total variation minimization". European Journal of Applied Mathematics 26, № 6 (1 червня 2015): 917–29. http://dx.doi.org/10.1017/s0956792515000236.
Повний текст джерелаEigel, Martin, Reinhold Schneider, and Philipp Trunschke. "Convergence bounds for empirical nonlinear least-squares." ESAIM: Mathematical Modelling and Numerical Analysis 56, no. 1 (January 2022): 79–104. http://dx.doi.org/10.1051/m2an/2021070.
Повний текст джерелаWei, Dennis, and Alan V. Oppenheim. "A Branch-and-Bound Algorithm for Quadratically-Constrained Sparse Filter Design." IEEE Transactions on Signal Processing 61, no. 4 (February 2013): 1006–18. http://dx.doi.org/10.1109/tsp.2012.2226450.
Повний текст джерелаAkcakaya, M., and V. Tarokh. "A Frame Construction and a Universal Distortion Bound for Sparse Representations." IEEE Transactions on Signal Processing 56, no. 6 (June 2008): 2443–50. http://dx.doi.org/10.1109/tsp.2007.914344.
Повний текст джерелаWang, Mianzhi, Zhen Zhang, and Arye Nehorai. "Further Results on the Cramér–Rao Bound for Sparse Linear Arrays." IEEE Transactions on Signal Processing 67, no. 6 (March 15, 2019): 1493–507. http://dx.doi.org/10.1109/tsp.2019.2892021.
Повний текст джерелаYujie Tang, Laming Chen, and Yuantao Gu. "On the Performance Bound of Sparse Estimation With Sensing Matrix Perturbation." IEEE Transactions on Signal Processing 61, no. 17 (September 2013): 4372–86. http://dx.doi.org/10.1109/tsp.2013.2271481.
Повний текст джерелаCai, T. Tony, and Anru Zhang. "Sharp RIP bound for sparse signal and low-rank matrix recovery." Applied and Computational Harmonic Analysis 35, no. 1 (July 2013): 74–93. http://dx.doi.org/10.1016/j.acha.2012.07.010.
Повний текст джерелаBauvin, Baptiste, Cécile Capponi, Jean-Francis Roy, and François Laviolette. "Fast greedy $$\mathcal {C}$$-bound minimization with guarantees." Machine Learning 109, no. 9-10 (September 2020): 1945–86. http://dx.doi.org/10.1007/s10994-020-05902-7.
Повний текст джерелаGao, Jian, Zhenghang Xu, Ruizhi Li, and Minghao Yin. "An Exact Algorithm with New Upper Bounds for the Maximum k-Defective Clique Problem in Massive Sparse Graphs." Proceedings of the AAAI Conference on Artificial Intelligence 36, no. 9 (June 28, 2022): 10174–83. http://dx.doi.org/10.1609/aaai.v36i9.21257.
Повний текст джерелаLuo, Luo, Cheng Chen, Guangzeng Xie, and Haishan Ye. "Revisiting Co-Occurring Directions: Sharper Analysis and Efficient Algorithm for Sparse Matrices." Proceedings of the AAAI Conference on Artificial Intelligence 35, no. 10 (May 18, 2021): 8793–800. http://dx.doi.org/10.1609/aaai.v35i10.17065.
Повний текст джерелаRazborov, A. A. "More about sparse halves in triangle-free graphs." Sbornik: Mathematics 213, no. 1 (January 1, 2022): 109–28. http://dx.doi.org/10.1070/sm9615.
Повний текст джерелаBirdi, Jasleen, Audrey Repetti, and Yves Wiaux. "Sparse interferometric Stokes imaging under the polarization constraint (Polarized SARA)." Monthly Notices of the Royal Astronomical Society 478, no. 4 (July 4, 2018): 4442–63. http://dx.doi.org/10.1093/mnras/sty1182.
Повний текст джерелаCompaleo, Jacob, and Inder J. Gupta. "Application of Sparse Representation to Bartlett Spectra for Improved Direction of Arrival Estimation." Sensors 21, no. 1 (December 25, 2020): 77. http://dx.doi.org/10.3390/s21010077.
Повний текст джерелаAnzt, Hartwig, Stanimire Tomov, and Jack Dongarra. "On the performance and energy efficiency of sparse linear algebra on GPUs." International Journal of High Performance Computing Applications 31, no. 5 (October 5, 2016): 375–90. http://dx.doi.org/10.1177/1094342016672081.
Повний текст джерелаDuan, Huiping, Linxiao Yang, Jun Fang, and Hongbin Li. "Fast Inverse-Free Sparse Bayesian Learning via Relaxed Evidence Lower Bound Maximization." IEEE Signal Processing Letters 24, no. 6 (June 2017): 774–78. http://dx.doi.org/10.1109/lsp.2017.2692217.
Повний текст джерелаXie, Yuan, Shaohan Huang, Tianyu Chen, and Furu Wei. "MoEC: Mixture of Expert Clusters." Proceedings of the AAAI Conference on Artificial Intelligence 37, no. 11 (June 26, 2023): 13807–15. http://dx.doi.org/10.1609/aaai.v37i11.26617.
Повний текст джерелаKoutris, Paraschos, and Shaleen Deep. "The Fine-Grained Complexity of CFL Reachability." Proceedings of the ACM on Programming Languages 7, POPL (January 9, 2023): 1713–39. http://dx.doi.org/10.1145/3571252.
Повний текст джерелаAh-Fat, Patrick, and Michael Huth. "Protecting Private Inputs: Bounded Distortion Guarantees With Randomised Approximations." Proceedings on Privacy Enhancing Technologies 2020, no. 3 (July 1, 2020): 284–303. http://dx.doi.org/10.2478/popets-2020-0053.
Повний текст джерела