[NeurIPS 2021 Spotlight] & [IJCV 2024] SOFT: Softmax-free Transformer with Linear Complexity
-
Updated
Mar 16, 2024 - Python
#
linear-complexity
Here are 5 public repositories matching this topic...
Small-Dimensional Quadratic Programming in Linear Time
-
Updated
Aug 4, 2022 - C++
Algorithm for solving the Hamiltonian cycle problem deterministically and in linear time on all instances of discocube graphs (tested for graphs with over 8 billion vertices). Discocube graphs are 3-dimensional grid graphs derived from: a polycube of an octahedron | a Hauy construction of an octahedron with cubes as identical building blocks...
rust
graph-algorithms
loops
discrete-mathematics
grids
sculpture
hamiltonian-cycle
graph-theory-algorithms
optmization
np-complete-problems
linear-complexity
3d-grid
3d-lattice
-
Updated
Jul 23, 2024 - Rust
An algorithm for solving the Hamiltonian cycle problem deterministically and in linear time on all instances of discocube graphs (tested for over graphs with 1 billion vertices).
rust
graph-algorithms
loops
discrete-mathematics
grids
3d
sculpture
hamiltonian-cycle
graph-theory-algorithms
np-complete-problems
linear-complexity
-
Updated
Mar 30, 2023 - Rust
This program takes a string and multiple delimiter characters as input, and splits the string based on said delimiters. The function that performs this returns a vector of tokens, which is actually the input broken down into small strings according to the delimiters provided.
-
Updated
Mar 21, 2024 - C++
Improve this page
Add a description, image, and links to the linear-complexity topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the linear-complexity topic, visit your repo's landing page and select "manage topics."