Search Results for "open personal data" - Page 6

A markup language for expressing knitting patterns which can serve as a software interchange format

The algorithm will carving zeros in an integer array initialized to "1". Data can be recorded in a simple way.

Project provides a set of concurrent building blocks (Java & C/C++) that can be used to develop parallel/multi-threaded applications. Components are grouped into 4 categories: 1.Data Structures 2. Parallel Patterns 3.Parallel functions 4.Atomics and STM

Provides bitwise, context-based 2nd generation data compression for large FASTQ-based files

A library of standard data structures in C, similar to STL in C++. Includes variable-length arrays, deques, hashtables, avl trees, binary heaps, and many other useful structures, with a simple and intuitive interface.

A GPU-based efficient data parallel formulation of the k-Nearest Neighbor (kNN) search problem which is a popular method for classifying objects in several fields of research, such as- pattern recognition, machine learning, bioinformatics etc.

This is a Java-based project for complex event extraction from text and co-reference resolution. Currently the code can read BioNLP shared task format (http://2011.bionlp-st.org/) and i2b2 Natural Language Processing for Clinical Data shared task format (https://www.i2b2.org/NLP/DataSets/Main.php). Event extraction includes finding events and the parameters for an event in a text. The method is based on SVM but other ML algorithms can be adopted. The method details are explained in the...

JSort is a library with some sorting algorithms implementation and related data structure. It has compare-based algorithms, linear sorting, graph sorting, priority based queue, and so on.

BlueDS is a library that contains the implementation of frequently used data structures and algorithms in Computer Science. BlueDS is designed to be fast and efficient.

Geom4J is a computational geometry library for Java. It contains implementation of the most important computational geometry data structures and algorithms coded in pure Java, designed for ease of use and optimized for performance.

SPLITNEURON is a completely new approach to large-scale, biologically plausible, neural-network simulation library based on data structures and methods directly coded into database and conceived to explicitly share load on multiple machines.

ExtraDix is a sorting algorithm based on Radixsort. It is faster than Quicksort, stable, realized in C and can sort by any basic data type. Testing was done with 1 million data records sorting char, short, int, long, float, double and strings.

Modules for developing, configuring and running a computation based on function blocks entirely in Python. Function block based computation is a data, event and state driven approach to data processing.

clibutils is collection of common data structures , This library supports any type, Following are the datastructures currently implemented. 1. Dynamic Array 2. Single Linked List 3. Heap 4. Map 4. Set.

breve is a free, open-source 3D multi-agent simulation package designed for simulating decentralized systems and artificial life.

EZvolve Foundation Classes is a set of data types and utility classes for use with evolutionary algorithms. Currently implemented support for bit string encoding, populations, fitnesses, fitness functions, probabilities, and probability vectors.

Don't hard-code data-structures for Artificial Intelligence (AI). Evolve them (and control flow) as cycles of arrays in arrays with size constraints based on other array sizes (at specific index) in terms of range, multiply, exponent, or permutation. No working code yet. Whats there now is an extension of GigaLineCompile which would become part of Human AI Net, but there are other projects to finish before I can come back to this one.

This projects hosts the worlds fastest algorithms for the labeling of point-features. It especially looks for algorithms thar are free of constraints, applicable to many scenarios (e.g., visualization, maps...) and do not need any preprocessing.

op4j is a developer happiness tool. Its aim is to reduce the amount of similar lines of code needed to do every day tasks in our code by providing an operator chaining tool to perform easy iterations on lists, OGNL evaluation, data type conversion...

A Java library and set of tools to quickly and easily manipulate graphs (set of nodes and edges) and dynamic graphs. The principal trait of this library is its ability to manage (create, edit, layout, display) continuously evolving graphs. The development of this project now takes place on Github. Visit the official Graphstream website at http://graphstream-project.org

An R package for detailed inspection and analysis of LCMS data. An R package developed by Sukhdeep Singh at Department of Surgery and Cancer, Imperial College London,UK.

XPN is relies on a non relational native XML database, where XML documents are stored in a compressed form and indices enables fast access to structure and content, thus enabling a fast evaluation of XQuery queries.

Ertha is an open source GIS whose main focus is to guarantee easy extensibility and straightforward integration of custom modules. It provides basic geographic rendering and topologic analysis and exposes the main data structures loaded from shapefiles.

API Java de visualisation et d'interaction dans le domaine des graphes.

Promote is an easy to use, generic data structure and utility library for C,C++, and possibly more.