Search Results for "http c tiny" - Page 3

An implementation of "k-Way Merging" as described in "Fundamentals of Data Structures" by Horowitz/Sahni. NOTE: This project has been moved to http://code.google.com/p/kway/

.Net Implementation of the BIDI algorithm, as described in http://www.unicode.org/reports/tr9/

Three software packages to work with RFC2617 digests: libdigest (C library to compute digests), libcppdigest (C++ library to manage /etc/passwd-like files) and libpam-digestfile (PAM module allowing authentication via an /etc/passwd-like file)

The library currently consists of an implementation of collision detection of static/moving ellipsoids that exploits frame-coherence using separating planes. Please visit http://www.cs.hku.hk/GraphicsGroup/cd.html for paper references.

http://code.google.com/p/geometry/

!!! The project has been renamed to "libanculus-sharp" and has been moved to googlecode : http://code.google.com/p/libanculus-sharp/ !!! LibCommon is a reusable library written in C#. It runs on Mono 1.2 or higher and .NET 2.0 or higher. It provides an

A .NET Library written in C# 2.0 for doing some mathematic operations as evaluating functions, plotting or finding roots. Visit the Project Web site at http://math-net.sourceforge.net.

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

The PvtTable transforms a simple SQL consult into CrossTables not normalized. You can vary relationships between severals lines and columns more: http://en.wikipedia.org/wiki/Crosstab framework compatibility code 1.1Framework used 1.4

malkriz is solver for griddlers (japanese puzzle) written as simple portable classes in c++. You'll find here complete programs using it, written for MSVC6, Qt and cgi. Web version (in slovak language): http://frix.fri.utc.sk/~johny/mkfrm.php

aptimelib is a new, extremely portable, generic, 64-bit, time/date library. It implements the proposal by David R. Tribble ( http://david.tribble.com/text/c0xlongtime.html ), featuring epoch basis, microsecond granularity, and platform translation.

Weka++ is a collection of machine learning and data mining algorithm implementations ported from Weka (http://www.cs.waikato.ac.nz/ml/weka/) from Java to C++, with enhancements for usability as embedded components.

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

Provides functional programming abstractions for C# including map, fold, filter functions for .NET collections, the option data type, a lazy type, a functional list type, lazy functional lists, and more. Superseded by http://sf.net/projects/sasa/