Search Results for "tree"
Sort By:
Showing 48 open source projects for "tree"
View related business solutions-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
Nonprofit Budgeting SoftwareMartus' collaborative and easy-to-use budgeting and reporting platform will save you hundreds of hours each year. It's designed to make the entire budgeting process easier and create unlimited financial transparency.
-
1
RBush
High-performance JavaScript R-tree-based 2D spatial index
...Open web console to see benchmarks; click on buttons to insert or remove items; click to perform search under the cursor. An optional argument to RBush defines the maximum number of entries in a tree node. 9 (used by default) is a reasonable choice for most applications. Higher value means faster insertion and slower search, and vice versa. -
2
Flatbush
A very fast static spatial index for 2D points and rectangles in JS
A really fast static spatial index for 2D points and rectangles in JavaScript. An efficient implementation of the packed Hilbert R-tree algorithm. Enables fast spatial queries on a very large number of objects (e.g. millions), which is very useful in maps, data visualizations and computational geometry algorithms. -
3
FATE
An industrial grade federated learning framework
...It implements secure computation protocols based on homomorphic encryption and multi-party computation (MPC). Supporting various federated learning scenarios, FATE now provides a host of federated learning algorithms, including logistic regression, tree-based algorithms, deep learning and transfer learning. FATE became open-source in February 2019. FATE TSC was established to lead FATE open-source community, with members from major domestic cloud computing and financial service enterprises. FedAI is a community that helps businesses and organizations build AI models effectively and collaboratively, by using data in accordance with user privacy protection, data security, data confidentiality and government regulations. -
4
DecisionTree.jl
Julia implementation of Decision Tree (CART) Random Forest algorithm
Julia implementation of Decision Tree (CART) and Random Forest algorithms. -
eProcurement SoftwareeBuyerAssist by Eyvo is a cloud-based procurement solution designed for businesses of all sizes and industries. Fully modular and scalable, it streamlines the entire procurement lifecycle—from requisition to fulfillment. The platform includes powerful tools for strategic sourcing, supplier management, warehouse operations, and contract oversight. Additional modules cover purchase orders, approval workflows, inventory and asset management, customer orders, budget control, cost accounting, invoice matching, vendor credit checks, and risk analysis. eBuyerAssist centralizes all procurement functions into a single, easy-to-use system—improving visibility, control, and efficiency across your organization. Whether you're aiming to reduce costs, enhance compliance, or align procurement with broader business goals, eBuyerAssist helps you get there faster, smarter, and with measurable results.
-
5
VR Paged List for C# and more
VR Paged List for C# and more
a collection of Vincent Radio {Adrix.NT} C# sources & build projects includes - Paged Lists & Iterators Library for C# - Multi Dimensional Array Library for C# - MDArray List Manager Library for C# - Adjacency (List | Matrix) Direct Graph Libs for C# - Range Check functions - VRMosaic (WinForms) - with Auto Resolver also includes - Source Files - Visual Studio Build Projects - Test Applics have fun adrixnt@hotmail.it -
6
VR Paged List GXS for C++ and more ...
Paged Lists & Iterators GXS for C++ Sources by Vincent Radio {Adrix.NT
Vincent Radio {Adrix.NT} presents Paged Lists & Iterators GXS for C++ Sources by Vincent Radio {Adrix.NT} also contains - Little Docs about Paged Lists (docx, pdf) - VR Basic Common Utils Sources (Array List ...) - VR Generic Multi Dim Array Class - VR Generic MDArray List Mgr Class - VR Generic Adjacency (List | Matrix) Direct Graph Classes - VR List Interface with STL Support with some nice implementations (ArrayList, Paged-LIst) - Env Var Notes for sources for C++... -
7
Elementary Algorithms
Book of elementary algorithms and data structures
This book introduces elementary algorithms and data structure. It includes side-by-side comparison of purely functional realization and their imperative counterpart. From 2020/12, I started re-writing this book. The PDF can be downloaded for preview (EN, 中文). The 1st edition in Chinese (中文) was published in 2017. I recently switched my focus to the Mathematics of programming, the new book is also available in (github). To build the book in PDF format from the sources, you need the following... -
8
MLPACK is a C++ machine learning library with emphasis on scalability, speed, and ease-of-use. Its aim is to make machine learning possible for novice users by means of a simple, consistent API, while simultaneously exploiting C++ language features to provide maximum performance and flexibility for expert users. * More info + downloads: https://mlpack.org * Git repo: https://github.com/mlpack/mlpack
-
9
Binarytree
Python library for studying Binary Trees
Binarytree is Python library that lets you generate, visualize, inspect and manipulate binary trees. Skip the tedious work of setting up test data, and dive straight into practicing algorithms. Heaps and BSTs (binary search trees) are also supported. Binarytree supports another representation which is more compact but without the indexing properties. Traverse trees using different algorithms. -
Easy-to-use Business Software for the Waste Management Software IndustryDOP Software’s mission is to streamline waste and recycling business’ processes by providing them with dynamic, comprehensive software and services that increase productivity and quality of performance.
-
10
Quadtree Demo
Demonstrates a quadtree for spatial indexing of triangles
...Depending on a search point all triangles of a quadtree's region are retrieved and relevant information about the search is shown. Quadtree creation can be parametrized by three parameters: - Maximum tree depth. - Maximum number of triangles per region. - Percentage of total number of triangles per region. The OpenGL graphics library is used to render the results, regions as well as the underlying triangle mesh. Navigation (e.g. zooming, moving) is available by keyboard and mouse. Example meshes are provided in wavefront *.obj format and can be opened from inside the program. -
11
StructPie
A set of C libraries to implement data structures and algorithms
...The stack, the tree and the hash table accept int, float and char* data type To look at the python library : https://github.com/mnoorfawi/struct-pie -
12
Java generic API for search algorithms on graphs implicitly given by tree node expansion operator
-
13
Creates an index to DBF files using a B+ Tree; Cria um indice para um arquivo DBF usando uma arvore B+; Implementação em C; Baseada em Arquivo;
-
14
The Edge Machine Learning library
Machine learning algorithms for edge devices
Machine learning models for edge devices need to have a small footprint in terms of storage, prediction latency, and energy. One instance of where such models are desirable is resource-scarce devices and sensors in the Internet of Things (IoT) setting. Making real-time predictions locally on IoT devices without connecting to the cloud requires models that fit in a few kilobytes.These algorithms can train models for classical supervised learning problems with memory requirements that are... -
15
algorithms.js
Classic algorithms and data structures implemented in JavaScript
Traditional Computer Science algorithms and data structures implemented in JavaScript. Algorithms such as collatzConjecture, extendedEuclidean, fastPower, fibonacci, findDivisors, fisherYates, gcd (Greatest common divisor), greatestDifference, lcm (Least common multiple), newtonSqrt, nextPermutation, powerSet, reservoirSampling, shannonEntropy, etc. -
16
bs
A B-tree based sequence library.
BS is a data structures library. It features fixed data size, random access sequences. The sequences are constructed over B-trees. Complexity for most single item operations is about O(logN). -
17
TreeLayout
Efficient and customizable TreeLayout Algorithm in Java, for NetBeans
Efficiently create compact, highly customizable tree layouts - Based on Walker's algorithm with enhancements suggested by Buchheim, Jünger, and Leipert the software builds tree layouts in linear time. I.e. even trees with many nodes are built fast. Downloads are available at https://sourceforge.net/projects/treelayout/files/. For detailed documentation look at the TreeLayout web site http://treelayout.sourceforge.net/. -
18
The library for utilization of Minimal Quadtree format for storing very large sparse matrices. Please see the paper referenced below for the description of a problem. Corresponding papers: Tree-based Space Efficient Formats for Storing the Structure of Sparse Matrices (I. Šimeček, D. Langr, P. Tvrdík), In Scalable Computing: Practice and Experience, volume 15, 2014. Space Efficient Formats for Structure of Sparse Matrices Based on Tree Structures (I. Šimeček, Daniel Langr, Pavel Tvrdík), In Proceedings of 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2013), 2013. ...
-
19
S-Match
S-Match is a semantic matching framework.
S-Match is a semantic matching framework. S-Match takes any two tree like structures (such as database schemas, classifications, lightweight ontologies) and returns a set of correspondences between those tree nodes which semantically correspond to one another. S-Match contains implementations of the semantic matching, minimal semantic matching and structure preserving semantic matching algorithms. -
20
CLAW is a C++ Library providing various tools in different domains, like a Tweener framework, Bézier curves manipulation, a map with multiple value types, a binary search tree container implemented as an AVL and an implementation of the sockets as std::stream. The library also includes a set of classes to easily load and write png, jpeg, gif files and other image formats. Finally, a part of the library is devoted to artificial intelligence in games and includes a generic alpha-beta algorithm. Each module is provided with an example program.
-
21
drvq
dimensionality-recursive vector quantization
...It is an approximation of k-means that is practically constant in data size and applies to arbitrarily high dimensions but can only scale to a few thousands of centroids. As a by-product of training, a tree structure performs either exact or approximate quantization on trained centroids, the latter being not very precise but extremely fast. A detailed README file describes the usage of the software, including license, requirements, installation, file formats, sample data, tools, and options. With the sample data provided and the default options, it is possible to test the code immediately as a demo. ... -
22
A capsule tree is a general purpose, self-balancing tree data structure for large, ordered, data-sets. It is designed to provide the same characteristics as B-trees and B+trees, but built from the ground up for in-memory usage. In other words, there are no provisions for “slow” I/O cases. The original motivation for this tree was a better backend for memory managers.
-
23
-
24
PhoneBookAVL
Phone Book Implemented in an AVL Tree
In this Project,you can find a Phone book is implemented in an AVL Tree, you add new contacts, delete, and save the list to a text file Please check the project files here: https://sourceforge.net/projects/phonebookavl/files/ -
25
the c prototyping tools library provides thread-safe linked list, priority queue, hash table, hash list, AVL tree and trie implementations, as well as a thread pool and thread management framework, a tcp and http socket api, and a dbms abstraction layer.
