Search alternatives:
effective implementation » effective prevention (Expand Search)
simple implementation » time implementation (Expand Search), pre implementation (Expand Search), optimal implementation (Expand Search)
python effective » proven effective (Expand Search), obtain effective (Expand Search), 1_the effective (Expand Search)
python simple » method simple (Expand Search)
Showing 1 - 20 results of 302 for search '(( python effective implementation ) OR ( python simple implementation ))', query time: 0.38s Refine Results
  1. 1
    Implementations benchmark.

    Implementations benchmark. by Serena Aneli (17002149)

    Published 2023
    Save to List
    Saved in:
  2. 2
    Recombination and mutation estimation times using the fastest (dynamic-numba) likelihood implementation depending on the number of markers.

    Recombination and mutation estimation times using the fastest (dynamic-numba) likelihood implementation depending on the number of markers. by Serena Aneli (17002149)

    Published 2023
    Save to List
    Saved in:
  3. 3
    Python3 implementation of the correlation-based regression algorithm.

    Python3 implementation of the correlation-based regression algorithm. by Sebastian J. Kopetzky (6059033)

    Published 2024
    Save to List
    Saved in:
  4. 4
    Maximal effective bandwidth of various vector operations.

    Maximal effective bandwidth of various vector operations. by Xuzhen He (14676114)

    Published 2023
    Subjects:
    Save to List
    Saved in:
  5. 5
    Optimal implementation of matrix operations on the CPU platform (double precision; solid black line = benchmarked bandwidth; lines + symbols = effective bandwidth; black = COPY2D; red = XPXPY20_2D; filled circles = <i>OpenMP parallel for</i> with cached access; hollow triangles = <i>OpenMP parallel for</i> with uncached access; filled diamonds = optimal implementation for corresponding vector operations; filled squares = XLA).

    Optimal implementation of matrix operations on the CPU platform (double precision; solid black line = benchmarked bandwidth; lines + symbols = effective bandwidth; black = COPY2D;... by Xuzhen He (14676114)

    Published 2023
    Subjects:
    Save to List
    Saved in:
  6. 6
    Model for the maximal effective bandwidth of numerical models (lines = model prediction by Eq 12; symbols = measured maximal effective bandwidth; filled = f64; hollow = f32; black = CPU medium; red = CPU large; blue = GPU medium; magenta = GPU large).

    Model for the maximal effective bandwidth of numerical models (lines = model prediction by Eq 12; symbols = measured maximal effective bandwidth; filled = f64; hollow = f32; black... by Xuzhen He (14676114)

    Published 2023
    Subjects:
    Save to List
    Saved in:
  7. 7
    Model for the effective bandwidth of element-wise operations (lines = model prediction by Eq 11; symbols = measured maximal effective bandwidth; filled symbols = matrix operations; hollow symbols = vector operations; circles = CPU; triangles = GPU; black = medium f64; red = medium f32; blue = large f64; magenta = large f32).

    Model for the effective bandwidth of element-wise operations (lines = model prediction by Eq 11; symbols = measured maximal effective bandwidth; filled symbols = matrix operations;... by Xuzhen He (14676114)

    Published 2023
    Subjects:
    Save to List
    Saved in:
  8. 8
    Optimal implementation of vector operations on the GPU platform (single precision; solid black line = benchmarked bandwidth; lines + symbols = effective bandwidth; black = COPY1D; red = XPXPY20_1D; filled circles = <i>CUDA</i> f32, hollow triangles = <i>CUDA</i> float4; filled squares = XLA).

    Optimal implementation of vector operations on the GPU platform (single precision; solid black line = benchmarked bandwidth; lines + symbols = effective bandwidth; black = COPY1D;... by Xuzhen He (14676114)

    Published 2023
    Subjects:
    Save to List
    Saved in:
  9. 9
    Optimal implementation of vector operations on the CPU platform (double precision; solid black line = benchmarked bandwidth; lines + symbols = effective bandwidth; black = COPY1D; red = XPXPY20_1D; filled circles = <i>OpenMP parallel for</i> with the maximal no. of threads, hollow circles = <i>OpenMP parallel for</i> with one thread; hollow triangles = single-thread SIMD; filled squares = XLA).

    Optimal implementation of vector operations on the CPU platform (double precision; solid black line = benchmarked bandwidth; lines + symbols = effective bandwidth; black = COPY1D;... by Xuzhen He (14676114)

    Published 2023
    Subjects:
    Save to List
    Saved in:
  10. 10
    Optimal implementation of COPY2D on the GPU platform of the PC (double precision; solid black line = benchmarked bandwidth; circle symbols = effective bandwidth with different shapes of thread block; black = 1 × 512, 1 × 128, 2 × 256, or 2 × 64; red = 4 × 128; blue = 16 × 32; magenta = 128 × 4; green = 512 × 1; filled diamonds + line = optimal for COPY1D; filled squares + line = XLA).

    Optimal implementation of COPY2D on the GPU platform of the PC (double precision; solid black line = benchmarked bandwidth; circle symbols = effective bandwidth with different shap... by Xuzhen He (14676114)

    Published 2023
    Subjects:
    Save to List
    Saved in:
  11. 11
    Optimal implementation of HEAT1D on the GPU platform (double precision; solid black line = benchmarked bandwidth; lines + symbols = effective bandwidth; red = VEC COPY; black = HEAT1D; filled circles = <i>CUDA</i> utilising L2 cache; hollow triangles = <i>CUDA</i> utilising shared memory; filled squares = XLA with slice and concatenation; hollow diamonds = XLA with convolution; hollow pentagons = XLA with roll).

    Optimal implementation of HEAT1D on the GPU platform (double precision; solid black line = benchmarked bandwidth; lines + symbols = effective bandwidth; red = VEC COPY; black = HEA... by Xuzhen He (14676114)

    Published 2023
    Subjects:
    Save to List
    Saved in:
  12. 12
    Optimal implementation of HEAT1D on the CPU platform (double precision; solid black line = benchmarked bandwidth; lines + symbols = effective bandwidth; red = COPY1D; black = HEAT1D; filled circles = <i>OpenMP parallel for</i> with the maximal no. of threads, hollow circles = <i>OpenMP parallel for</i> with one thread; hollow triangles = single-thread SIMD; filled squares = XLA with slice and concatenation; hollow diamonds = XLA with convolution; hollow pentagons = XLA with roll).

    Optimal implementation of HEAT1D on the CPU platform (double precision; solid black line = benchmarked bandwidth; lines + symbols = effective bandwidth; red = COPY1D; black = HEAT1... by Xuzhen He (14676114)

    Published 2023
    Subjects:
    Save to List
    Saved in:
  13. 13
    Optimal implementation of HEAT2D and NS2D on the CPU platform (double precision; solid black line = benchmarked bandwidth; lines + symbols = effective bandwidth; black = HEAT2D; red = NS2D; filled circles = <i>OpenMP parallel for</i> with cached access; hollow triangles = <i>OpenMP parallel for</i> with uncached access; filled squares = XLA with slice and concatenation; hollow diamonds = XLA with convolution; hollow pentagons = XLA with roll).

    Optimal implementation of HEAT2D and NS2D on the CPU platform (double precision; solid black line = benchmarked bandwidth; lines + symbols = effective bandwidth; black = HEAT2D; re... by Xuzhen He (14676114)

    Published 2023
    Subjects:
    Save to List
    Saved in:
  14. 14
    Optimal implementation of HEAT2D and NS2D on the GPU platform (double precision; solid black line = benchmarked bandwidth; lines + symbols = effective bandwidth; black = HEAT2D; red = NS2D; blue = XPXPY12_2D; filled circles = <i>CUDA</i> utilising L2 cache; hollow triangles = <i>CUDA</i> utilising shared memory; filled squares = XLA with slice and concatenation; hollow diamonds = XLA with convolution; hollow pentagons = XLA with roll).

    Optimal implementation of HEAT2D and NS2D on the GPU platform (double precision; solid black line = benchmarked bandwidth; lines + symbols = effective bandwidth; black = HEAT2D; re... by Xuzhen He (14676114)

    Published 2023
    Subjects:
    Save to List
    Saved in:
  15. 15
    Table_1_An application programming interface implementing Bayesian approaches for evaluating effect of time-varying treatment with R and Python.pdf

    Table_1_An application programming interface implementing Bayesian approaches for evaluating effect of time-varying treatment with R and Python.pdf by Chen Chen (6544)

    Published 2023
    “…Here, we introduce an application programming interface (API) that implements both BART and GP for estimating averaged treatment effect (ATE) and conditional averaged treatment (CATE) for the two-stage time-varying treatment strategies.…”
    Save to List
    Saved in:
  16. 16
    Python sript.

    Python sript. by Kan Jia (6438599)

    Published 2025
    Save to List
    Saved in:
  17. 17
    EthoPy: Reproducible Behavioral Neuroscience Made Simple

    EthoPy: Reproducible Behavioral Neuroscience Made Simple by Alexandros Evangelou (22235917)

    Published 2025
    Save to List
    Saved in:
  18. 18
    Hardware parameters of optimal implementations.

    Hardware parameters of optimal implementations. by Xuzhen He (14676114)

    Published 2023
    Subjects:
    Save to List
    Saved in:
  19. 19
    Locality of reference in optimal implementations.

    Locality of reference in optimal implementations. by Xuzhen He (14676114)

    Published 2023
    Subjects:
    Save to List
    Saved in:
  20. 20
    Tools used in implementing the RNN models.

    Tools used in implementing the RNN models. by Fahmi H. Quradaa (17896527)

    Published 2024
    Subjects:
    Save to List
    Saved in:

Search Tools: