Search alternatives:
algorithm pre » algorithm where (Expand Search), algorithm used (Expand Search), algorithm from (Expand Search)
algorithm npc » algorithm etc (Expand Search), algorithm pca (Expand Search), algorithm _ (Expand Search)
pre function » spread function (Expand Search), sphere function (Expand Search), three function (Expand Search)
npc function » spc function (Expand Search), gpcr function (Expand Search), fc function (Expand Search)
algorithm i » algorithm _ (Expand Search), algorithm b (Expand Search), algorithm a (Expand Search)
i function » _ function (Expand Search), a function (Expand Search), 1 function (Expand Search)
algorithm pre » algorithm where (Expand Search), algorithm used (Expand Search), algorithm from (Expand Search)
algorithm npc » algorithm etc (Expand Search), algorithm pca (Expand Search), algorithm _ (Expand Search)
pre function » spread function (Expand Search), sphere function (Expand Search), three function (Expand Search)
npc function » spc function (Expand Search), gpcr function (Expand Search), fc function (Expand Search)
algorithm i » algorithm _ (Expand Search), algorithm b (Expand Search), algorithm a (Expand Search)
i function » _ function (Expand Search), a function (Expand Search), 1 function (Expand Search)
-
1
-
2
Prediction performance of different optimization algorithms.
Published 2021“…<p>(A) 3 algorithms were compared in terms of the residuals of the cost function of the optimized TF on 7 mice datasets (Derivative free algorithm failed in optimizing a TF in a mouse). …”
-
3
Comparison of deconvolution and optimization algorithms on a batch of data.
Published 2021“…Both experimental data have been resampled at 50ms and used to compute a set of TFs (in orange) either with direct deconvolution approaches (Fourier or Toeplitz methods, middle-upper panel TFs) or with 1-Γ function optimization performed by 3 different algorithms (middle-lower panel TFs). …”
-
4
-
5
-
6
-
7
-
8
-
9
-
10
-
11
-
12
-
13
As for Fig 2, we present failure rates as a function of the cohort size (vertical axis) versus the number of distractors (horizontal axis), for the Smyth and McClave baseline algor...
Published 2020“…We note that the middle row is a special case: here, <i>f</i><sub>target</sub> only corresponds to the proportions of the embedded cohort, while “success” for these two panels is defined as recovering maximally diverse cohorts, as this particular algorithm is designed to do. …”
-
14
Sliding window analysis with a window size of 1000 nucleotides and a step size of one base-pair.
Published 2024Subjects: -
15
-
16
-
17
-
18
-
19
Data_Sheet_1_Modeling intracranial electrodes. A simulation platform for the evaluation of localization algorithms.pdf
Published 2022“…Introduction<p>Intracranial electrodes are implanted in patients with drug-resistant epilepsy as part of their pre-surgical evaluation. This allows the investigation of normal and pathological brain functions with excellent spatial and temporal resolution. …”
-
20
Algorithm membership function.
Published 2022“…<p>(Top) Input Membership Function. The algorithm classifies glucose input into 4 sets: low, medium, high, and ex_high. …”