-
Updated
Jan 22, 2021
linear-algebra
Here are 1,432 public repositories matching this topic...
Add quickselect algorithm. Quickselect is a selection algorithm to find the kth smallest element in an unordered list.
-
Updated
Jan 16, 2021 - Java
-
Updated
Sep 27, 2019 - Jupyter Notebook
-
Updated
Apr 12, 2021 - Java
-
Updated
Apr 19, 2021 - TypeScript
-
Updated
Apr 11, 2021 - C#
Forgive me if this already exists, because I couldn't find it in the docs, but is there a way to construct a matrix row-by-row using an iterator? (for cases when source data structure already represents them in row-by-row form)
Currently the only way I found is creating matrix NxM using from_iterator, and then invoking transpose to get MxN, but this is rather inefficient - first, it nee
-
Updated
Apr 17, 2021 - PHP
-
Updated
Jan 7, 2021 - C++
-
Updated
Jan 22, 2021 - C
-
Updated
Mar 26, 2021
-
Updated
Nov 26, 2017 - Jupyter Notebook
-
Updated
Apr 15, 2021
-
Updated
Jan 18, 2021 - Rust
-
Updated
Apr 14, 2021 - OCaml
-
Updated
Apr 14, 2021 - C
-
Updated
Apr 14, 2021 - C++
-
Updated
Apr 17, 2021 - Nim
-
Updated
Apr 21, 2021 - Rust
-
Updated
Apr 19, 2021 - C++
-
Updated
Apr 18, 2021 - TypeScript
-
Updated
May 28, 2020 - Python
-
Updated
Apr 12, 2021 - Java
-
Updated
Apr 4, 2021 - C++
-
Updated
Mar 29, 2021 - Mathematica
-
Updated
May 17, 2019 - C++
Improve this page
Add a description, image, and links to the linear-algebra topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the linear-algebra topic, visit your repo's landing page and select "manage topics."
At this moment relu_layer op doesn't allow threshold configuration, and legacy RELU op allows that.
We should add configuration option to relu_layer.