Search Results for "max"

Julia implementation of Decision Tree (CART) and Random Forest algorithms.

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

Serve timeouts by calling a service-function periodically and an independent time-source (toticker). If you need a timer and like to try this one, please write your experiences to me in brief! And may be suggestions, of course. 10ms tick time should be possible. May be less. DO NOT USE Version less 0.1.1 - it is definatly buggy! Easy to control timers via Handle, eg auto create&start a timer via totimer_setTimeout function. Optionally use Callback-Functions if timeout...

A deap is a doubly priority queue for efficient data operations. Both insertion and deletion operations take O(log(N)) time. Access of min or max takes constant time. It can be useful when both min and max are needed in the queue. It can also be used in situations where the number of items is too large and items with low priorities can be dropped with keep memory footprint small.

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. However, the end result was a new sub-category of trees. The implementation giving here is just one implementation of...

"UltraQueue" is a library (DLL) project, written in C++. This library is intended to be used for very fast temporary data storage, aquired by any possible source (File, Serial Port, ...). Users can create multiple queues of differrent sizes & types

Dictmatch is a high performance multi-mode string match lib which supports full matching and max forward matching. It is used to match substrings which contented in dictionary from string user provides. Its throughout is more than 20w line per sec.

Dictionary-tree is a standard dictionary, means a lexicographic tree (acyclic graph), where letters are nodes of tree, starting from root going down to leaves. You can Get and Add words, Clear and Save the whole dictionary. C++ and Pascal.