Search Results for "c algorithms" - Page 9
Sort By:
Showing 384 open source projects for "c algorithms"
View related business solutions-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
Build Agents and Models on One PlatformGemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
-
1
-
2
LSGTL means LLX’s Static Graph Template Library which is a light-weighted header-only template library developed mainly for static graph analysis. LSGTL is expected to be used in laboratories for research purposes mostly.
-
3
NT2 is a multi-platform C++ library providing various template matrix classes that can be used with a Matlab(tm) like syntax whose performances are close to those obtained with hand written C code. NT2 comes with various numerical toolboxes.
-
4
-
Cut Data Warehouse Costs by 54%BigQuery delivers 54% lower TCO with exabyte scale and flexible pricing. Free migration tools handle the SQL translation automatically.
-
5
Sequential and parallel implementation of string quicksorts(-select) . Articles: On the number of string lookups in BSTs (and related algorithms) with digital access/ Combining digital access and parallel partition for quicksort and quickselect.
-
6
Implementation of paralell partitioning algorithms achieving an optimal number of comparisons. See L. Frias and J. Petit. Parallel partition revisited. http://dx.doi.org/10.1007/978-3-540-68552-4_11 for further reference.
-
7
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.
-
8
Software capaz de procesar un texto y codificarlo según la famosa codificación CRC32 de 32 bits. Es una práctica que hemos hecho en MPII. Soy Darío López Padial, estudiante del curso Liberación de Proyectos de Software Libre.
-
9
The project is created with an aim to provide - design patterns implemented in C++ using boost. Following are the primary requirements 1) Generic Header Only Library 2) Using Boost Libraries, Coding Style, Philosophy 3) Standard C++
-
99.99% Uptime for MySQL and PostgreSQL DatabasesCloud SQL Enterprise Plus delivers near-zero downtime with 35 days of point-in-time recovery. Supports MySQL, PostgreSQL, and SQL Server.
-
10
Libgxl++ is a library based on the libxml++ and libxml2 to provide a complete and efficient API to parse and manipulate the GXL format.
-
11
OnuriS (Open soURce wImax Simulator) is a simulation platform designed for WiMAX in order to analyze network performances and develop particular allocators for better bandwidth allocation strategies that could greatly improve the overall system.
-
12
This is an intelligent Sudoku solver in c++. It is intlligent, because it uses several logical deduction methods, just like a person, before resorting to guessing. I was trying to teach my kids Sudoku, and taught a computer as proof of concept.
-
13
An implementation of Bruhn et al.'s fast variational optical flow algorithm using the OpenCV image processing library. The code calculates dense flow fields with a user-specified level of precision.
-
14
Sterobil is a project used to build a 3D model from photographic pictures, based on the principle of photogrammetry. This project was developped by ECE students, in collaboration with the C2RMF.
-
15
Fast cython implementation of trie data structure for Python. Development is inactive, but moved to: http://github.com/martinkozak/cytrie.
-
16
Tpl makes it easy to serialize your C data using just a handful of API functions. The data is stored in its native binary form for maximum efficiency. C, Perl and XML supported. Data is portable across CPU types and OS's from Unix to Mac to Windows.
-
17
The package edmonds-alg contains a C++-implementation of Edmonds's optimum branching algorithm as described by Tarjan in 1977.
-
18
Implementation of Multikey Quickselect and new Multikey Quicksort variants in Frias L, Roura, S. Multikey Quickselect. Technical report LSI-09-27-R, Universitat Politècnica de Catalunya, 2009. http://www.lsi.upc.edu/dept/techreps/techreps.html.
-
19
Implementation of cache conscious STL lists in Frias, L., Petit, J., and Roura, S. 2009. Lists revisited: Cache-conscious STL lists. J. Exp. Algorithmics 14 (Dec. 2009), 3.5-3.27. DOI= http://doi.acm.org/10.1145/1498698.1564505
-
20
A simple component usable for converting a non-deterministic finite automaton to a deterministic finite automaton.
-
21
The MemSL for C and C++ includes a complete data structures/collection classes library, memory tracing, memory debugging, logging, entry/exit tracing, exception handling, definable memory handlers, built-in threads support and much more.
-
22
AVL Array is a sequence container (like std::vector or std::list) that allows fast insert/remove AND fast random access. Shiftable Files offers the usual file primitives plus fast insert/remove. Get the latest version via BZR in the Develop section.
-
23
Spreadsort is a fast general-case in-place hybrid radix/comparison algorithm, which tends to be roughly twice as fast as std::sort. This library has calls to sort integers, floats, or strings, or other data types based upon integer, float, or string keys
-
24
-
25
Very basic cellular automaton implementation in C#. Based upon the "Togetherness" algorithm described at http://www.hermetic.ch/pca/tg.htm.