Search Results for "source" - Page 3
Sort By:
Showing 257 open source projects for "source"
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.
-
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
1
The C Algorithms library has moved to GitHub. Please go to the new project page: https://github.com/fragglet/c-algorithms
-
2
ctsa
A Univariate Time Series Analysis package in ANSI C
CTSA is a C software package for univariate time series analysis. This is a work in progress. ARIMA and Seasonal ARIMA models have been added so far. Other functionality will be added soon . Documentation - https://github.com/rafat/ctsa/wiki -
3
Ginors Sort
sorting algorithm for binary keys
in-place sorting algorithm with O(n*log(k)) time komplexity. The data have to be the structure: struct { unsigned (char/short/int/long); [...] } -
4
NeuroSolutions: Formula Generator
Utility converts the weights file of a MLP Breadboard into a formula
The NeuroSolutions: Formula Generator utility converts the weights file of a default MLP breadboard (1-hidden layer with a TanhAxon in the hidden layer and either a TanhAxon or BiasAxon in the output layer) into a usable formula that can be copied and pasted into your own programs to compute the output of the trained neural network. -
Go From AI Idea to AI App FastAccess Gemini 3 and 200+ models. Build chatbots, agents, or custom models with built-in monitoring and scaling.
-
5
OptimC
OptimC - Optimization / Unconstrained Minimization Library in ANSI C
OptimC is a C software package to minimize any unconstrained multivariable function. The algorithms implemented are Nelder-Mead,Newton Methods (Line Search and Trust Region methods), Conjugate Gradient and BFGS (regular and Limited Memory). Brent method is also available for single variable functions if the bounds are known. Update 06/09/2014 - Nonlinear Squares Implementation [Levenberg-Marquardt Method] Added. Documentation - http://code.google.com/p/optimc/ -
6
libcutils
Some Useful C-Utilities
Libcutils provides a self-contained set of fundamental routines which are essential to basically any Unix utility or daemon application written in C. The library provides fundamental data structures such as lists, hash-maps, strings and parsing functions for JSON or the typical dot-file based configuration data. The following list summarizes the currently supported functionality: * length delimited instead of NULL terminated strings * memory management based on reference... -
7
A light-weight Regular Expression (regex) C library, using double-recursion. (command prompt tester included)
-
8
XanLib is a Linux library which provides data structures like hash tables, lists, pipes etc.. Each data structure exposes both synchronized and not synchronized methods.
-
9
Distributed Multithread Apriori (DMTA)
A parallel implementation using MPI and OpenMP to Apriori algorithm
DMTA (Distributed Multithreaded Apriori) is a parallel implementation of Apriori algorithm, which exploits the parallelism at the level of threads and processes, seeking to perform load balancing among the cores. Was implemented in C++ language, using the parallelization libraries OpenMP and MPI. The algorithm was generated as a result of a project developed by André Camilo Bolina, under the guidance of teachers Marluce Rodrigues Pereira, Ahmed Ali Abdalla Esmin and Denilson Alves Pereira,... -
AI-powered service management for IT and enterprise teamsGive your IT, operations, and business teams the ability to deliver exceptional services—without the complexity. Maximize operational efficiency with refreshingly simple, AI-powered Freshservice.
-
10
The fstrcmp project provides a shared library for making fuzzy string comparisons, and also provides an fstrcmp command for use in shell scripts.
-
11
ktree
clustering, machine learning, algorithms
This project has moved to github at http://lmwtree.devries.ninja. -
12
Pre-projetos_MLCM - É um conjunto de Programas e códigos fonte dos mesmos, com finalidade educacionais para a área de TI. Sendo eles programas simples que foram desenvolvidos para a aquisição de nota no curso de BCC. Os programas em si, estão ainda em desenvolvimento sendo disponibilizado uma prévia dos progressivos resultados, não se tendo uma data de finalização do projeto definida. Fica a disposição os códigos deles sobre a licença GPL para que estudantes e interessados possam fazer uso e...
-
13
This library implements a thread-safe skip list data structure - a kind of list with good insertion, deletion and searching performances. It uses Fred Fish's dbug library as internal tracing/debugging system. See the web site for more details.
-
14
matrix.h
Some basic matrix algorithms implemented in C
This is a collection of some matrix algorithms like matrix inverse, LU decomposition, Gauss elimination, matrix multiplication, matrix pow, matrix add, matrix subtract etc. This package also contains debugging information for the above algorithms -
15
DDMTestbed
An independent Data Distribution Management testbed
DDMTestbed is a testbed that allows you to generate random instances and evaluate your proposed resolutive method measuring execution time, memory occupied and distance from the optimal solution. It has been written in C language. -
16
gridrpcdm
Library implementing the GridRPC and GridRPC DM OGF stantards.
This library is a common implementation of both the Open Grid Forum GridRPC API _and_ GridRPC API Data Management standards. It is completely modular and already supports middleware modules for DIET and Ninf, as well as data manager modules for iRods, OwnCloud, rsync, scp. The installation is made easy with cmake and testing examples can be launched in a one line command. -
17
Open Object Oriented ANSI C provide API to build Object Oriented application in ANSI C language. It provide common base classes that allow inheritance to develop application with your own reusable objects, and smart exception recovery support
-
18
JSolutions
The solution to all your problems
The Jsolution package is a collection of programs, scripts,libraries and documents that i have written and use in my daily life. -
19
Dantzig-Wolfe Solver
An implementation of Dantzig-Wolfe decomposition built upon GLPK
An implementation of Dantzig-Wolfe decomposition built upon the GNU Linear Programming Kit. This is a command line tool for solving properly decomposed linear programs. There are several examples and some documentation to guide the use of this solver. Forked over to GitHub (see link). -
20
Shobhit-Improved String Search
SHOBHIT-Improved String Search is new improved string search algorithm
In Computer Science, SHOBHIT-Improved String Search Algorithm is a string searching algorithm created by SHOBHIT UPADHYAYA in August, 2013. He is working as a Software Developer in Bangalore India. “This algorithm uses the first, last, mid1 and mid2 index of the substring for a pattern search.” TIME and SPACE Complexity: For a text of length n and substring of length m. Its best case, time complexity is O(m/4) and in worst case, time complexity is O(n – (m/4) ). In all the... -
21
SHOBHIT-Advance String Search
SHOBHIT-Advance String Search is a pattern search Algorithm
In Computer Science, SHOBHIT-Advance String Search Algorithm is a string searching algorithm created by SHOBHIT UPADHYAYA in 2013. He is working as a Software Developer in Bangalore India. “This algorithm uses the first and last index of the substring for a pattern search.” TIME and SPACE Complexity: For a text of length n and substring of length m. Its best case, time complexity is O(m/2) and in worst case, time complexity is O(n – (m/2) ). In all the cases best, average and... -
22
-
23
A capsule tree is a general purpose, self-balancing tree data structure for large, ordered, data-sets. It is designed to provide the same characteristics as B-trees and B+trees, but built from the ground up for in-memory usage. In other words, there are no provisions for “slow” I/O cases. The original motivation for this tree was a better backend for memory managers. However, the end result was a new sub-category of trees. The implementation giving here is just one implementation of...
-
24
The Safe C Library provides bound checking memory and string functions per ISO/IEC TR24731. These functions are alternative functions to the existing standard C library that promote safer, more secure programming. The ISO/IEC Programming languages — C spec, C11, now includes the bounded APIs in Appendix K, "Bounds-checking interfaces". This latest upload supports building static library, a shared library and a linux kernel module.
-
25
Technical analysis library with indicators like ADX, MACD, RSI, Stochastic, TRIX... includes also candlestick pattern recognition. Useful for trading application developpers using either Excel, .NET, Mono, Java, Perl or C/C++.
