Search Results for "b-tree implementation" - Page 5

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.

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

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

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

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.

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

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

The DIDT (Distributed Id3-based Decision Tree) algorithm implementation in JAVA.

A quad tree implementation in C++, useful for spatial partitioning in 2D games and 3D games.

JDots, Java Dynamic Object Tree Software. A library/framework to create a dynamic tree of Java objects, for active method communication/propagation. Java implementation of the BEAST project.

This is a simple ray tracing algorithm implementation. The same algorithm is implemented on CPU and GPU with CUDA, and the performance of the GPU based ray tracing is much better than the naive CPU one. cuda and directx sdk are required.

aztree library is an implementation of most types of tree data-structure in C language. The library will implement these different type of trees. Binary, Self-balancing binary search, B-trees, Tries, BSP, Non-binary and few used in Computer Graphics

B-Tree implemented in Common Lisp. Stores key/value pairs onto disk based data structure. Current implementation has been tested with SBCL. Project was originally at alien-consader.org but is now made available at SourceForge.

Python implementation of LaGrange, Bezier, and B-spline curves. The algorithms use their respective interpolation/basis functions, so are capable of producing curves of any order. The B-splines use Cox-De Boor and support knot insertion. 2-d only.

The project contains a portable in-memory implementation of R-tree and R*-tree written in C++

This project at NICTA implements a broadcast routing protocol called Shortest Path Tree Broadcast (SPTB) under ns-2. This release also contains our implementation of a benchmark protocol called “TwoHop” which uses 2-hop neighbour information.

The Open Protocol for Access Control Identification and Ticketing with privacY, is a standard suite of Key Establishment and Authentication protocols based on ECC and AES, for optimized contactless transactions and simple PKI based Key management.

CIVx is a free advanced PIV (Particle Imaging Velocimetry) code, developped in Fortran and C++. Input : pair of png images. Output : velocity field in NetCDF format. It is used by the UVMAT Matlab code develloped at LEGI.

ProDT is a Prolog Integrated Development Environment (IDE) aiming to be as rich in functionality as the Eclipse's java IDE, and to support any standard Prolog implementation. Currently is being supported SWI Prolog, B-Prolog and XSB Prolog

A simple Ternary Search tree implementation, which also includes delete and getting common prefixes operation. I've tested it on Linux WindRiver 1.4 box with g++. Please report bugs at kunalekawde2002@yahoo.com

EPSI (Erlang Publish-Subscribe Infrastructure) is an Erlang implementation of a distributed infrastructure providing a content-based publish-subscribe service to its clients.

This project is done a part of curriculum in the 3rd year of b-tech. The skeleton program is taken from Beej's Guide and is elaborated to my particular need. The program works as the basic tftp protocol, although it doesn't implement it completely.

This project is about the implementation of algorithms studied during mathematics and computer graphic courses for my MS's last year ( Point cloud approximation, Hermitian interpolation, Bezier / B-Spline Curves, Convex Hull, Delaunay triangulation

Fast cython implementation of trie data structure for Python. Development is inactive, but moved to: http://github.com/martinkozak/cytrie.

olsrd is an implementation of the Optimized Link State Routing(OLSR, RFC3626) protocol. The implementation is extendable through the use of loadable plugins. Visit http://www.olsr.org for more info. <b>This sf.net page is OUTDATED!!</b> Visit www.olsr.or