Search Results for "b-tree implementation" - Page 5
Sort By:
Showing 184 open source projects for "b-tree implementation"
View related business solutions-
Gemini 3 and 200+ AI Models on One PlatformBuild generative AI apps with Vertex AI. Switch between models without switching platforms.
-
Try Google Cloud Risk-Free With $300 in CreditUse your credit across every product. Compute, storage, AI, analytics. When it runs out, 20+ products stay free. You only pay when you choose to.
-
1
its.bhtree
Behavior Tree AI
A Behavior Tree for implementation of AI within BlitzMAX. -
2
Cost-sensitive Classifiers
Adaboost extensions for cost-sentive classification
Adaboost extensions for cost-sentive classification CSExtension 1 CSExtension 2 CSExtension 3 CSExtension 4 CSExtension 5 AdaCost Boost CostBoost Uboost CostUBoost AdaBoostM1 Implementation of all the listed algorithms of the cluster "cost-sensitive classification". They are the meta algorithms which requires base algorithms e.g. Decision Tree Moreover, Voting criteria is also required e.g. Minimum expected cost criteria Input also requires to load an arff file and a cost matrix (sample arff and cost files are uploaded for users' reference) This extension uses weka for classification and generates the classification model along with confusion matrix. ... -
3
gel
Generic Layer Framework for Java Applications
The gel framework provides tools for several functionality purposes in Java (client and server) applications. These tools make the code smaller and simpler by implementing solutions for common functionality and design patterns, mostly related to GUI effects, multithreading and configurability. The framework contains several components that might be used separately according to dependancies. -
4
drvq
dimensionality-recursive vector quantization
drvq is a C++ library implementation of dimensionality-recursive vector quantization, a fast vector quantization method in high-dimensional Euclidean spaces under arbitrary data distributions. 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. -
Custom VMs From 1 to 96 vCPUs With 99.95% UptimeLive migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
-
5
redblackweb
A red-black tree HTML5 showcase
A red-black tree HTML5 showcase. Contains: => the demo page => the redblack.js implementation of the redblack tree -
6
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.
-
7
Advanced Data Structures
Implementation of Leftist Tree and Binomial Heap
The project implements two advanced data structures namely Binomial Heap and Leftist Tree. Project runs in two modes random mode: which determines average cost required to perform single operation on both data structures. user mode: where user performs series of operation on these data structures from input file which also displays the final tree after all operations. -
8
XmlPlus xsd2cpp : C++ XML Data Binding
c++ xml data binding tool (free - lgpl)
Provides XML Data Binding for C++ through XML Schema. Features: a) xsd2cpp - generates C++ XML Objects(X/O mapping) b) XML I/O ie. marshalling-unmarshalling(serialization-deserialization) c) roundtrip retains processing instructions and comments -
9
Stand-alone Java library implementing parser/formatter/comparator/validator for JSON/XML-like text formats oriented on JSON-like object model (list,map,scalar + reflection). Library is designed to maximize adaptivity via set of extendable modules.
-
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.
-
10
sigtran-smsc
PoC: Short Message Service Center (SMSC) over SIGTRAN
...It uses following protocol stack: MAP (moForwardSM and mtForwardSM) TCAP (Begin with Invoke + End with ReturnResultLast) SUA (SCCP User Adaptation): ASP UP/ASP ACTIVE + ACK's and CLDT messages only SCTP (Linux Kernel - SCTP implementation) IP Current implementation is tested in SAMK NGN [http://www.samk.fi/ngn] laboratory's 3G mobile network (real Nokia MSC/VLR network hardware with UTRAN RLC and node-B). Thesis URL: http://urn.fi/URN:NBN:fi:amk-2013052210011 -
11
Semantic query optimization (SQO) is the process of finding equivalent rewritings of an input query given constraints that hold in a database instance. We present a Chase & Backchase (C&B) algorithm strategy that generalizes and improves on well-known methods in the field. The implementation of our approach, the pegasus system, outperforms existing C&B systems an average by two orders of magnitude. This gain in performance is due to a combination of novel methods that lower the complexity in practical situations significantly.
-
12
This is an advanced keyer implementation for Atmel AVR controllers written in C. The supported keyer modes are Iambic A/B and Ultimatic. Commands are entered using a paddle or a straight key. The memory can be extended using an external eeprom.
-
13
VHDT
VHDL Design Tool - code generation and project management
Application simplifies the development and management of VHDL projects. The project is displayed in a well-arranged tree structure depending on the hierarchy of entities. It also helps to maintain projects in a consistent state. Other features include automatic generation of VHDL testbenches and structures based on user-defined templates. The NetBeans platform is used as a basis for the implementation. -
14
MR-plus
MR+ advocates a departure from a fixed two-stage process of MapReduce.
The implementation of MR+ is derived from Hadoop MapReduce. However, unlike Hadoop, MR+ enables both map and reduce to interleave, as well as the same key to be reduced by different reduce workers in parallel – permitting multi- level reduces. In the MR+ implementation, although the role of the JobTracker and Task- Tracker is identical to that in Hadoop, the details of task scheduling are completely different. -
15
ParsInsert efficiently produces both a phylogenetic tree and taxonomic classification for sequences for microbial community sequence analysis. This is a C++ implementation of the Parsimonious Insertion algorithm.
-
16
This project aims to provide an extensible Tree interface to supplement the Java Collections framework, making full use of Java 5 generics. At least one reference implementation will be provided as part of the scope of this project.
-
17
Pysimony
A Pythonic Implementation of Parsimony Inference of Phylogeny
UPDATE: After some bug fixes, I've ditched Pysimony for Javamony: https://sourceforge.net/projects/javamony/ Given Python's beauty, I know that someday I will have to finish Pysimony. A student's first attempt at a phylogenetic inference program, written in the simplistic yet elegant Python. Pysimony reads a FASTA file (only ATGC accepted) specified as its only argument. Basic testing has shown that it is slow, inaccurate and most definitely inefficient. An... -
18
(We have migrated this project to github [June 1 2015)] http://github.com/msg-byu/enumlib). The source files have been removed from sourceforge. Go to github (link above) for the latest copy. <<<< OLD SUMMARY >>>> A Fortran 95 implementation of an algorithm for generating derivative structures of a parent lattice. The algorithm is discussed in detail in: Gus L. W. Hart and Rodney W. Forcade, "Algorithm for generating derivative structures," Phys. Rev. B 77 224115 (26 June 2008) http://msg.byu.edu/papers/GLWHart_enumeration.pdf Gus L. W. Hart and Rodney W. ...
-
19
PhyloTempo
R Scripts for Assessing/Visualizing Temporal Clustering in Genealogies
Serially-sampled nucleotide sequences can be used to infer demographic history of evolving viral populations. The shape of a phylogenetic tree often reflects the interplay between evolutionary and ecological processes. Several approaches exist to analyze the topology and traits of a phylogenetic tree, by means of tree balance, branching patterns and comparative properties. The temporal clustering (TC) statistic is a new topological measure, based on ancestral character reconstruction, which characterizes the temporal structure of a phylogeny. ... -
20
Ticket Cluster
Java aplication who groups related text documents, text mining
...This is done without preconceptions about keywords — this Java software analyzes the text and identifies the structure that arises naturally. The extraction phase depends of the data of the helpdesk, in the current implementation there is a php script who extracts all text from numered tickets (Facil HelpDesk ) to a folder. Once created the folder with text, run ticket cluster, select folder and click process. After processing is done you can watch results in dendogram or tree. Text mining, text clustering using LINGO -
21
Occursions
Fast customizable time series web database for big data like log files
Our goal is to create the world's fastest extendable, non-transactional time series database for big data (you know, for kids)! Log file indexing is our initial focus. For example append only ASCII files produced by libraries like Log4J, or containing FIX messages or JSON objects. Occursions was built by a small team sick of creating hacks to remotely copy and/or grep through tons of large log files. We use it to index around a terabyte of new log data per day. You can use it too. Who... -
22
Prefix Tree
A lighting-fast prefix tree and DAWG implementation in C and python
A lighting-fast prefix tree (trie) and compressed prefix tree (DAWG) implementation. This library can be usefull for longest-prefix matching, code completion, dictionary compression, spell checking. -
23
Recursive LDD
Recursive implementation of List Dynamic Dependencies (LDD)
Recursive LDD (recursive-ldd) is a Perl script that allows displaying a tree-like hierarchy of shared library dependencies. The script calls on the standard Linux ldd utility in a recursion for every listed binary and library. It completes running when no matches are found in the current branch. It can also print unique values only as well as environment variables that affect the loading of libraries: LD_LIBRARY_PATH and LD_PRELOAD. Same limitations to standard ldd apply. Recursive-ldd... -
24
Zebra_MPTT
A PHP implementation of the modified preorder tree traversal algorithm
Zebra_MPTT is a PHP class that provides an implementation of the modified preorder tree traversal algorithm making it easy for you to use MPTT in your PHP applications. It provides methods for adding nodes anywhere in the tree, deleting nodes, moving and copying nodes around the tree and methods for retrieving various information about the nodes. Zebra_MPTT uses table locks making sure that database integrity is always preserved and that concurrent MySQL sessions don’t compromise data integrity. ... -
25
