-
plan proposé par @AntoninLagarrigue (Discord : Zinzolin)
**Module I: Introduction**
_Notions fondamentales_
1. Introduction
2. Bandit Multi-armes
3. Processus de décision markoviens
…
-
Problem Statement: Introduction to DP on Strings – Longest Common Subsequence
-
Taking some inspiration from MILC: Inverted List Compression in Memory, we should implement their algorithm but add some changes for Java and some improvements for compression ratio:
* No SIMD tric…
-
# Complete Java + DSA Bootcamp Syllabus
## NOTE
- All topics will contain problems from LeetCode Easy to Hard, explained in an easy-to-understand manner.
- Complete custom implementation of all …
-
Hi Demetrios, how are you?
Thanks for this notebook, excellent description.
I have a similar problem but in 2 dimensions, do you have a solution for this type of case or do you know how I could …
-
When trying to calculate the Frechet distance between two linestrings (each around 1500 segments), I get a segmentation fault on windows 10.
I can avoid this, by specifying the stack reserve size i…
-
(cc @craffel @dpwe)
The current peak picker uses a greedy heuristic to select peaks from a time series `x(t)`, after narrowing down to a set of time points that satisfy some selection criteria (local…
-
Hi,
When you read the book pdf, say I am reading Chapter 3. "3. Dynamic Programming Algorithms", the python code ("clearance_pricing_mdp.py") for the chapter has been located in chapter4 of the rl …
-
When discussing the Thrust JIT support with the CCCL team, a question was raised regarding the usage of the `jit.thrust.device` policy in the test suite, ex:
https://github.com/cupy/cupy/blob/be5d7f…
-
Hi,
I know recursive calls are not the strong point of Halide. You can still make recursive IIR filters for example:
iir(0) = 0
RDom rx(1, N-1);
iir(rx) = (1 - alpha)*iir(rx - 1) +…