Search alternatives:
fast approximation » first approximation (Expand Search), phase approximation (Expand Search), state approximation (Expand Search)
method algorithm » network algorithm (Expand Search), means algorithm (Expand Search), mean algorithm (Expand Search)
code algorithm » cosine algorithm (Expand Search), novel algorithm (Expand Search), modbo algorithm (Expand Search)
data code » data model (Expand Search), data came (Expand Search)
element » elements (Expand Search)
fast approximation » first approximation (Expand Search), phase approximation (Expand Search), state approximation (Expand Search)
method algorithm » network algorithm (Expand Search), means algorithm (Expand Search), mean algorithm (Expand Search)
code algorithm » cosine algorithm (Expand Search), novel algorithm (Expand Search), modbo algorithm (Expand Search)
data code » data model (Expand Search), data came (Expand Search)
element » elements (Expand Search)
-
1
Summary of greedy algorithms presented in this section. Details of approximation factors for FastGreedy and UnitGreedy may be found in [26] and [25], respectively.
Published 2025“…<p>Summary of greedy algorithms presented in this section. Details of approximation factors for FastGreedy and UnitGreedy may be found in [<a href="http://www.ploscompbiol.org/article/info:doi/10.1371/journal.pcbi.1012539#pcbi.1012539.ref026" target="_blank">26</a>] and [<a href="http://www.ploscompbiol.org/article/info:doi/10.1371/journal.pcbi.1012539#pcbi.1012539.ref025" target="_blank">25</a>], respectively.…”
-
2
G R code algorithm.
Published 2024“…The algorithm was developed and coded in Verilog and simulated using Modelsim. …”
-
3
-
4
-
5
-
6
-
7
-
8
-
9
-
10
Dual deconvolution algorithm: analysis code with experimental data
Published 2025“…<p dir="ltr">This software package provides key algorithms for dual-deconvolution microscopy analysis, along with both experimental and numerical data. …”
-
11
-
12
-
13
-
14
-
15
-
16
-
17
-
18
-
19
-
20