Fast unbounded queue with efficient allocation
-
Updated
Nov 30, 2022 - Go
Fast unbounded queue with efficient allocation
TypedMap implementation
This is a simple library that tries to memory efficiently provide a `IndexMap` like functionality, that might have a large number of data with string keys, using vecs
IISAN: Efficiently Adapting Multimodal Representation for Sequential Recommendation with Decoupled PEFT
Compression-accelerated distributed DNN training system at large scales.
A simplified, generic, entity based web library for golang that's drop in compatible with net/http
Official PyTorch implementation of the CVPRW 2023 paper
Implements a subset of PKCS#7/Cryptographic Message Syntax (rfc2315, rfc5652) with stream signing and verifying
Play this game here for free :
Collision-prone memory-efficient collections
The official implementation of MeDQN algorithm.
An Implementation of Deep Q Network using TensorFlow
Xor Linked List is a Memory Efficient Doubly Linked-List
A memory-efficient matching algorithm (Kuhn–Munkres and Hopcroft–Karp) implementation based on JGraphT in Java
Testing the experimental Valhalla project of the JDK
A lightweight and memory-efficient HTTP client module for MicroPython, optimized for use cases on resource-constrained devices such as ESP32.
Efficiently handle JSON array files in Node.js with minimal memory usage. Perfect for efficiently processing large data volumes without worrying about memory limitations
BLOCKSET: Efficient out of core tree ensemble inference
Lowering PyTorch's Memory Consumption for Selective Differentiation
Add a description, image, and links to the memory-efficient topic page so that developers can more easily learn about it.
To associate your repository with the memory-efficient topic, visit your repo's landing page and select "manage topics."