IEEE

Bounds and Algorithms for Alphabetic Codes and Binary Search Trees

Abstract: Alphabetic codes and binary search trees are combinatorial structures that abstract search procedures in ordered sets endowed with probability distributions. In this paper, we design new ...
IEEE

Comparison of the Approaches to the Traversal of a Binary Tree Structure Using Iterators

Abstract: The tree (hierarchical) structure is one of the elementary memory arrangements, used by numerous data structures – ranging from simple to relatively sophisticated ones. The most well-known ...
GitHub

TypeScript Remove (tsr) is a utility that removes unused code from TypeScript projects – It's like tree shaking, but for source files

tsr statically analyses your TypeScript project like how tree-shaking is implemented in bundlers. Run tsr to get a list of unused exports and files (modules) in your TypeScript project. Use tsr in ...
GitHub

Tree-Shu-Zhao/ITQ_PyTorch

usage: run.py [-h] [--dataset DATASET] [--root ROOT] [--code-length CODE_LENGTH] [--max-iter MAX_ITER] [--topk TOPK] [--gpu GPU] ITQ_PyTorch optional arguments: -h ...