-
781
-
782
-
783
Counting Independent Sets Using the Bethe Approximation
Published 2011“…Finally, as a consequence of our analysis we prove that the Bethe approximation is exceedingly good for a random 3-regular graph conditioned on the shortest cycle cover conjecture of Alon and Tarsi [SIAM J. Algebr. Discrete Methods, 6 (1985), pp. 345–350] being true.…”
Get full text
Get full text
Get full text
Article -
784
-
785
High-Resolution Remote Sensing Image Change Detection Method Based on Improved Siamese U-Net
Published 2023-07-01“…Focusing on problems of blurred detection boundary, small target miss detection, and more pseudo changes in high-resolution remote sensing image change detection, a change detection algorithm based on Siamese neural networks is proposed. Siam-FAUnet can implement end-to-end change detection tasks. …”
Get full text
Article -
786
Diversity of Morphology, Physiologi, Biochemistry and Virulence of Xanthomonas citri sub sp. citri Causes Cancer in Citrus
Published 2022-05-01“…Diketahui ada empat galur yang virulen (LB04, NP02, PB05, dan SP05) pada jeruk lemon, nipis, purut, dan siam dengan masa inkubasi 23–27 hari, insidensi 22.25–90.15%, dan keparahan 15.80–78.85%. …”
Get full text
Article -
787
Hyperspectral Video Tracker Based on Spectral Deviation Reduction and a Double Siamese Network
Published 2023-03-01“…In this regard, this paper proposes a novel hyperspectral video tracker where the double Siamese network (D-Siam) forms the basis of the framework. Moreover, AlexNet serves as the backbone of D-Siam. …”
Get full text
Article -
788
Optimal Model Management for Multifidelity Monte Carlo Estimation
Published 2017Get full text
Get full text
Get full text
Article -
789
-
790
-
791
-
792
Non interactive simulation of correlated distributions is decidable
Published 2018Get full text
Article -
793
-
794
-
795
-
796
-
797
-
798
Approximating cycles in directed graphs: Fast algorithms for girth and roundtrip spanners
Published 2022“…© Copyright 2018 by SIAM. The girth of a graph, i.e. the length of its shortest cycle, is a fundamental graph parameter. …”
Get full text
Article -
799
Equivalences between triangle and range query problems
Published 2021“…Copyright © 2020 by SIAM We define a natural class of range query problems, and prove that all problems within this class have the same time complexity (up to polylogarithmic factors). …”
Get full text
Article -
800
Stable Rank-Adaptive Dynamically Orthogonal Runge–Kutta Schemes
Published 2024Get full text
Article