Search Results for "computer science projects"

pgapack, the parallel genetic algorithm library is a powerfull genetic algorithm library by D. Levine, Mathematics and Computer Science Division Argonne National Laboratory. The library is written in C. PGAPy wraps this library for use with Python.

...The project demonstrates how reinforcement learning can be used to automatically discover efficient algorithms for matrix multiplication — a fundamental operation in computer science and numerical computation. The repository is organized into four main components: algorithms, benchmarking, nonequivalence, and recombination. These contain implementations of the discovered matrix multiplication algorithms, tools to benchmark their real-world performance, proofs of nonequivalence among thousands of solutions, and methods for decomposing larger problems into smaller factorizations. ...

DEBay: Deconvolution of Ensemble through Bayes-approach DEBay estimates cell type-specific gene expression by deconvolution of quantitative PCR data of a mixed population. It will be useful in experiments where the segregation of different cell types in a sample is arduous, but the proportion of different cell types in the sample can be measured. DEBay uses the population distribution data and the qPCR data to calculate the relative expression of the target gene in different cell types in...

C++, Matlab and Python library for Hidden-state Conditional Random Fields. Implements 3 algorithms: LDCRF, HCRF and CRF. For Windows and Linux, 32- and 64-bits. Optimized for multi-threading. Works with sparse or dense input features.

PyVision is a object-oriented Computer Vision Toolkit for researchers that contains vision and machine learning algorithms and algorithm analysis and easily interfaces with scipy/numpy, PIL, opencv and other computer and machine learning libraries.

A proximity forest is a data structure that allows for efficient computation of approximate nearest neighbors of arbitrary data elements in a metric space. See: O'Hara and Draper, "Are You Using the Right Approximate Nearest Neighbor Algorithm?", WACV 2013 (best student paper award). One application of a ProximityForest is given in the following CVPR publication: Stephen O'Hara and Bruce A. Draper, "Scalable Action Recognition with a Subspace Forest," IEEE Conference on Computer...

Automated computer program grading solutions designed for trainings on computer languages, data structures and algorithms. See http://openjudge.net for details.

Institute of Technology, Blanchardstown Computer Science code by the class of 2007-2011 on course BN104. In this project we are open sourcing all of our project work to the public in the hopes it can be reused, built-upon, and used in education.