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

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 ...
GitHub

313DEVGRP/Java-Service-Tree-Framework-Core-Library

* 313 DEV GRP는 2010년 12월에 출범한 자바 개발자 그룹입니다. * TSF(Java-Service-Tree-Framework)는 MIT License로 배포됩니다. * 개인, 기업, 정부에서 무료로 사용이 가능합니다. MVC패턴을 구현한 다양한 프레임워크를 대상으로 ( EgovFramework 기반한 ) 서비스레이어의 도메인 ...