Search Results for "c algorithms" - Page 8
Sort By:
Showing 845 open source projects for "c algorithms"
View related business solutions-
$300 Free Credits for Your Google Cloud ProjectsLaunch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
-
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
GTkNN
GPU-based Textual kNN (GT-kNN)
The following code is a parallel kNN implementation that uses GPUs for the high dimensional data in text classification. You can use it to classify documents using kNN or to generate meta-features based on the distances between a query document and its k nearest neigbors -
2
Navigation Shortest Map Dhaval Kadia
Shortest Path Navigator with Directions and Distance
Programmed on Language C. A nano-Infant of GOOGLE-MAP Optimized to Consume some MB instead of 50 GB of RAM This was Programmed Quarter Year ago in 2014 -
3
HeaDDaCHe
Hashed dynamic determinants for convex hulls
Description: We propose and implement in C++ the hashed dynamic determinants scheme. This consists of efficient implementations of dynamic determinant algorithms and a hash table that stores intermediate results (matrices and determinants) in order to be used in subsequent steps of the algorithm. Related papers: V.Fisikopoulos, L.Peñaranda. Faster Geometric Algorithms via Dynamic Determinant Computation. -
4
SWAPHI-LS: Alignment on Xeon Phi Cluster
Smith-Waterman long DNA sequence alignment on Xeon Phi clusters
The first parallel Smith-Waterman algorithm exploiting Intel Xeon Phi clusters to accelerate the alignment of long DNA sequences. This algorithm is written in C++ (with a set of SIMD intrinsic extensions), OpenMP and MPI. The performance evaluation revealed that our algorithm achieves very stable performance, and yields a performance of up to 30.1 GCUPS on a single Xeon Phi and up to 111.4 GCUPS on four Xeon Phis sharing a host. -
Go from Code to Production URL in SecondsSkip the Kubernetes configs. Cloud Run handles HTTPS, scaling, and infrastructure automatically. Two million requests free per month.
-
5
Alpha stable distributions for C++
C++ code to perform Alpha stable fit
This code is the translation into C++ of part of the Matlab code from Mark Veillette available at: http://www.mathworks.com/matlabcentral/fileexchange/37514-stbl--alpha-stable-distributions-for-matlab -
6
HitCrypt
Descritografar e Criptografar XMLs do Tribunal de Justiça
O HitCrypt é uma ferramenta que pode ser utilizada para Decryptar o arquivo de Selos e Encryptar. Inicialmente este aplicativo está preparado para funcionar para o tribunal de justiça do estado de Minas Gerais. -
7
Turing McCabe-Explorer
An exploration utility to view, render and record TMC-patterns
This utility is designed for comfortable and rich control over Turing-McCabe-patterns. It offers realtime exploration using several input parameters, storing and restoring settings, recording videos and taking snapshots of steps as well as rendering patterns in HD. -
8
detectIR
Detection of Perfect and Imperfect Inverted Repeats
detectIR - a MATLAB-based tool for detecting perfect and imperfect inverted repeats in genomes. [1] Who are we? Please visit website: http://bioinfolab.miamioh.edu [2] How to cite detectIR? Ye C, Ji G, Li L, Liang C (2014) detectIR: A Novel Program for Detecting Perfect and Imperfect Inverted Repeats Using Complex Numbers and Vector Calculation. PLoS ONE 9(11): e113349. http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0113349 [3] detectIR user manual... -
9
vrecko
virtual environment framework
Vrecko is a component-based system capable of management and display of virtual worlds using various input and output devices. It is in development by HCI (Human-Computer Interaction) laboratory at Faculty of Informatics, Masaryk University, Czech Republic. -
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.
-
10
HH-Evolver
A framework for domain-specific, hyper-heuristic evolution
HH-Evolver is a framework for domain-specific, hyper-heuristic evolution. HH-Evolver automates the design of domain-specific heuristics for planning domains. Hyper-heuristics generated by our tool can then be used with combinatorial search algorithms such as A* and IDA* for solving problems of the given domain. -
11
Diagonal
A command line toolki to solve a problem your favorite program defines
Diagonal can be used for: - getting descriptive statistics such as mean/median/mode with your program producing a sample - finding a root of an equation your program defines - calculating a fixed point of a function your program defines - detecting a cycle of a fuction your program defines as well as - decoding a VCDIFF file -
12
libmng -THE reference library for reading, displaying, writing and examining Multiple-Image Network Graphics. MNG is the animation extension to the popular PNG image-format.
-
13
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 -
14
-
15
MatlabSimulink2CPP
Demo of Simulink to C++ C or HDL FGA for HFT potential
Video and files download for Visual trading idea to C++ or FPGA HFT Meetup File download sample: test model (Matlab 2014b with Visual Studio 2013 C++ project generated) Powerpoint MATLAB SIMULINK http://quantlabs.net/blog/2015/04/video-and-files-download-for-visual-trading-idea-to-c-or-fpga-hft-meetup/ -
16
Switch
Switch.
-
17
Triepocalypse
A trie data structure extracted from the typing game Typocalypse.
The typing game Typocalypse (https://code.google.com/p/typocalypse/source/browse/#hg/Trie) used a trie data structure which has been linked to separately from the game and has been of separate interest for some years now. It has now been given its own repository. A trie is a data structure used to find strings from their prefixes. After having stored strings in the trie, the trie will efficiently find all the strings which start with a particular prefix. Project was developed using C#... -
18
librfc
Public domain implementations of core RFC specifications for C/C++.
librfc is a C/C++ shared library containing public domain implementations of core RFC data structures and algorithms written in C++11. -
19
The library for utilization of Minimal Quadtree format for storing very large sparse matrices. Please see the paper referenced below for the description of a problem. Corresponding papers: Tree-based Space Efficient Formats for Storing the Structure of Sparse Matrices (I. Šimeček, D. Langr, P. Tvrdík), In Scalable Computing: Practice and Experience, volume 15, 2014. Space Efficient Formats for Structure of Sparse Matrices Based on Tree Structures (I. Šimeček, Daniel Langr, Pavel...
-
20
PartWriter
A project designed to write sheet music.
The project is composed of two layers. The first layer is an artificial intelligence engine, partwriter, that writes music based on some heuristic. The second layer is the layer that defines the heuristic. The definition of this heuristic defines the type of music that partwriter will create. Currently (December 2012), the deepest layer is more or less complete. The author is now writing second layers of interest, namely species counterpoint heuristics according to Fux's Gradus Ad Parnassum. -
21
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); [...] } -
22
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. -
23
Project CIF(Core Information Foundation)
c++ and c library to help build win32 software and others platforms
The project CIF now created with new philosophy of JPM (Joint Project Module) with SDK style. Now simply include CIF.h and use all of functions, macros and classes. BTS (Basic Text Support) Library Used in TOM (Text Object Module). TOM for now with CAnsiString , CAnsiStringLite And Text namespace. CAnsiString created with more functionality then typical string and text classes. EVS (Enhanced Visual Support) provide COpenFileDialog And CSaveFileDialog. JCM (Joint Core Module) used as base... -
24
Genetic Algorithms Engine - Blackjack
A genetic algortihm engine that evolves blackjack basic strategy.
This project is a genetic algorithm engine able to be reused for other projects with minimal additional programming. The genetic algorithm engine currently plays many blackjack hands for the fitness function and produces a result similar to blackjack basic strategy. To see it in action, download the zip file and run either: GABlackjack_Demo.exe (quick) or GABlackjack_Long.exe (slow, but it achieves better results). The code was written in C++, using MS Visual Studio 6.0... -
25