Search Results for "ekho-data"

* Fast C++ library for linear algebra (matrix maths) and scientific computing * Easy to use functions and syntax, deliberately similar to Matlab / Octave * Uses template meta-programming techniques to increase efficiency * Provides user-friendly wrappers for OpenBLAS, Intel MKL, LAPACK, ATLAS, ARPACK, SuperLU and FFTW libraries * Useful for machine learning, pattern recognition, signal processing, bioinformatics, statistics, finance, etc. * Downloads:...

MhcFS2 - engineering calculator. (v. 1.2 b141) (math expression calculator, scientific calculator, numerical, integral,integration, derivative, root, matrix, differencial, differentiation, equation, LSE,ODE )

...In the "hash_table" directory, the hash table implementation uses linked lists. While in "HashBSTree" directory, a hash table with a binary tree in each index is implemented for faster lookup in large data. 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

CDS (Concurrent Data Structures) is a C++ template library of lock-free and fine-grained lock-based algorithms. It contains a collection of concurrent data structures: queues, stacks, sets, maps, etc, and safe memory reclamation schema for concurrent containers - Hazard Pointer and user-space RCU. See doxygen doc http://libcds.sourceforge.net/doc/cds-api/index.html.

Libcutils provides a self-contained set of fundamental routines which are essential to basically any Unix utility or daemon application written in C. The library provides fundamental data structures such as lists, hash-maps, strings and parsing functions for JSON or the typical dot-file based configuration data. The following list summarizes the currently supported functionality: * length delimited instead of NULL terminated strings * memory management based on reference counting * several list processing functions like iterators and map-reduce * support of [Ideal Hash Tries](http://infoscience.epfl.ch/record/64398/files/idealhashtrees.pdf) for highly efficient hash map data structures * parsers for [JSON](http://json.org) data and the text configuration files found in Unix system * doubly linked circular lists for reliable event queues * support for test and debugging of memory management problems such as memory leaks

DRAMMS is a software package designed for 2D-to-2D and 3D-to-3D deformable medical image registration tasks. Released by Section of Biomedical Image Analysis (SBIA) at the University of Pennsylvania. Some typical applications of DRAMMS include, -- Cross-subject registration of the same organ (can be brain, breast, cardiac, etc); -- Mono- and Multi-modality registration (MRI, CT, histology); -- Longitudinal registration (pediatric brain growth, cancer development, mouse...

Cascading and Sharing Survival Trees (CSST) is a tree-based enseble that allows to efficiently analize survival data. It is a strightforward extension of the CS4 method for lifetime collections of data. The CSST software comes along with its companion the CSST Prediction tool, to use the ensemble prediction in everyday life. Please, refer to the user's manual for further information.

Tpl makes it easy to serialize your C data using just a handful of API functions. The data is stored in its native binary form for maximum efficiency. C, Perl and XML supported. Data is portable across CPU types and OS's from Unix to Mac to Windows.

ADTL is an Advanced Data structures Template Library written in C++. it includs sixteen kinds of stl-like contains, such as fibonacci heap,pariring heap,skew heap,avl tree,red-black tree,splay tree,skip list, unrolled linked list and so on.

A library for Lock-Free Data Structures

This project has moved. Please follow the WWW link below.

The Flexible Registration and Evaluation Engine (f.r.e.e.) allows the composition, evaluation and optimization of image processing/registration algorithms. It also aims to boost the exchangeability and comparability of data and algorithms in research.

CGL(C Generic Library) is a stl-like library written in pure C.It implements iterators, memory management,generic containers such as list,map, generic algorithms such as sort() and search(),and it can manipulate any types of data.

Machine learning toolkit for unsupervised and semi-supervised clustering that demonstrates excellent results on real-world data (see Bekkerman et al. ICML-2005 and ECML-2006).

UIMP(Unified Image Manipulation Program) is an OS independent Image Processing system, which provides over 1000 algorithms and supports web online, console and GUI program.

basE91 is an advanced method for encoding binary data as ASCII characters. It is similar to UUencode or base64, but is more efficient. The overhead produced by basE91 depends on the input data. It amounts at most to 23% and can range down to 14%.

A verification library accompanied by a simple tool for verification of credit-cards, social security-numbers and other mod(10) and similar checksums in a standard shell-environment from the command-line or as a function. No compilation required.