Search Results for "performance" - Page 4

QuickMP (Quick Multi-Processing) is a simple cross-platform C++ API for generating parallel for loops in shared-memory programs, similar to OpenMP. It provides automatic scalable performance based on the number of available processors.

FastAOP is an very high performant AOP (Aspect Oriented Programming) framework for java. The framework was initially developped to support performance profiling and monitoring for large J2EE applications with nearly no runntime overhad. Announcement: jp-mobile and fastAOP will go mobile, please visit jp-mobile (GWT based) website at: http://code.google.com/p/jp-mobile/

...It provides a generic framework for the study of the Boosting algorithms. The framework provides the different tasks for boosting: Learning, Validation, Test, Profiling and Performance Analysis

Threading Building Blocks offers a rich and complete approach to expressing parallelism in a C++ program. It is a library that helps you leverage multi-core processors for performance and scalability without having to be a threading expert.

Sorting algorithm performance testing using a generic test interface

PyLife is an implementation of the game of life algorithm featuring parallel programming. It uses MPI and python to achieve a consistent software architecture and reliably performance.

Robust Perl OO Module for Digest based Authentication leveraging DBI as a backend. This Performance oriented Hash Authentication Library is scalable from single pc to multi-database single signon www applications. Optionally uses Javascript and Cookies.

Conrad is both a high performance Conditional Random Field engine which can be applied to a variety of machine learning problems and a specific set of models for gene prediction using semi-Markov CRFs.

Fast cryptography extension for Tcl. TclTomCrypt is a sensible binding that brings the features and performance of LibTomCrypt to Tcl.

SDD: Duplicated code detection tool

This distribution contains a novel fast CRC generation algorithm developed by Intel. This algorithm runs at under 3 cycles per byte (vs. 7) and thus triples the performance of existing CRC implementations. Slicing-by-8 uses an 8KB cache footprint.

High-performance computing code and libraries used in the High Performance Computing subject in Telecommunications Engineering at the University of Granada (http://geneura.ugr.es/~jmerelo/asignaturas/AAP)

A high-performance C++ Sudoku solver implementing Knuth's Dancing Links (DLX) algorithm — one of the fastest exact cover algorithms in the world.

The Rank Aggregation and Evaluation Suite is a comprehensive set of rank aggregation algorithms and performance measurement tools for use in research.

Path Partitioner constructs random graph partitions and solves the linear (or integer) programming problems that assign weights to the edges such that the performance ratio of the local search algorithm for the Path Partitioning problem is minimized. See http://www.tau.ac.il/~ohadschn/Thesis/Partitioning.pdf. Requirements: Microsoft Automatic Graph Layout http://research.microsoft.com/en-us/projects/msagl/ Gurobi Optimizer http://www.gurobi.com/ Permutations, Combinations, and Variations using C# Generics http://www.codeproject.com/Articles/26050/Permutations-Combinations-and-Variations-using-C-G

...So I'm going to deobfuscate LZO and provide a ISC implementation of this algorithm in Python and C. In addition, I will provide a textual description of the algorithm so that it can be easily ported to any programming language. I expect a severe performance degradation, but I leave optimizing for speed to other people.