Search Results for "most" - Page 2

AAARF, written in PERL and with numerous adjustable parameters, identifies sequence overlaps in small shotgun sequence datasets and walks them out to create long pseudomolecules representing the most abundant repeats in a genome.

...It provides the following major functions: * A device and system independent image format for storing images and information about them. Called the RLE format, it uses run length encoding to reduce storage space for most images. * A library of C routines for reading, writing and manipulating images stored in the RLE format. * A collections of programs for manipulating and displaying RLE images. License: says it's "GNU like" in the license.

That project (RMOL) aims at giving developers concerned by the Revenue Management arena a library delivering a reference implementation for most of the published algorithms and methods. That library is intended to be used in simulated environment: it does not intend to be used in real world production systems.

...The main focus of the algorithm is to encode structural characteristics of a given list, such as coherent intervals and repeated distances. Therefore, the quality of compression depends on diversity rather than size. In most cases, IntZip is able to achieve much better compression results than general compression algorithms on such data sets.

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

AlgART Java libraries for processing arrays and matrices are open-source product, distributed under MIT license. So, anyone can use them for free without any restrictions. Main features: 63-bit addressing of array elements (64-bit long int indexes), memory model concept (allowing storing data in different schemes from RAM to mapped disk files), wide usage of lazy evaluations, built-in multithreading optimization for multi-core processors, wide set of image processing algorithms over...

Mouse Run is a programming game where programmers can implement a mouse and let it run in a maze to hunt of cheese. It is a battle among programmers to test who can build the most intelligent mouse, given limited information during the game. Programmers need only implement one code file, extending from an abstract class that will contain the logic of the individual mouse. The game Host will gather all the mouse implementation and let them run in the maze. It is real fun for geeks/nerds/(or whatever you like to call yourself) like us. ...

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.

This library is a lightweight implementation of genetic algorithm, contains the most popular types of chromosomes and the basic algorithms for selection, elitism, crossing and mutation.

PHP Business Rules is an open source application layer for PHP. The logic is defined in rules and facts. Like most Business Rule Engines (BRE) it uses the Rete algorithm.

Java implementation of the most commonly used algorithms for exact string matching, where the pattern is given first.

LazyEngine is a collection of Tools for PHP, C# and JavaScript (based on JQuery). The goal is to have a Library that contains most common functions daily used by software developers.

Genijatorics is a library providing solutions to enumerative combinatorial problems. The most prominent example of its use is for generating events in specified date range from CRON-like descriptions. It also serves for educational purposes.

JSONER is a JavaScript library intented to simplify most used operations with JSON based on event API on JSON tree. It includes: data lookup and binding solution, HTML form by JSON dynamically creation and population, transformation and comparison JSONs.

A simple (~20 line python) O(n^6) algorithm for the traveling salesman problem that seems to do pretty well for most graphs; so well that I have not been able to find a graph which it does optimally solve. Those with spare cycles are welcome to help out.

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

musicomp is a program which most important element is an evolutionary algorithm which uses data mining methods as a fitness function to generate monophone melodies.

CSGraph is a simple graph library. It provides the most popular algorithms to create and manipulate graphs.

The NSketch library provides implementations of most common sketch-based algorithms (histograms, quantile, frequent items, bloom filter ...). The library is written in C# for .Net.