Search Results for "c-support.vim" - Page 6
Sort By:
Showing 845 open source projects for "c-support.vim"
View related business solutions-
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.
-
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.
-
1
leet
Leet is CCEx's software application for on-the-fly encryption (OTFE).
The name leet stands for "Linux exquisite encryption tool", it will be a software application for on-the-fly encryption, similar in its functionality to TrueCrypt. The goal of leet however is to be simpler and as user friendly as possible, making encryption and securing of information accessible to anybody, even those who don't necessarily have any prior knowledge of data securing, algorithms and encryption. However it's not targeted at this group of users only, part of the ambition of... -
2
CognitionMaster
object-based image analysis framework
Wienert S, Heim D, Kotani M, Lindequist B, Stenzinger A, Ishii M, Hufnagl P, Beil M, Dietel M, Denkert C, Klauschen F. CognitionMaster: an object-based image analysis framework. Diagn Pathol 2013, 8:34 -
3
FUMOLA - Functional Mock-up Laboratory
An FMI-based co-simulation framework.
FUMOLA is a co-simulation framework specifically designed to support the features offered by the FMI specification. It provides a flexible platform that allows to configure and execute co-simulation setups in an easy way. FUMOLA is developed on top of the Ptolemy II framework (https://ptolemy.eecs.berkeley.edu) and the FMI++ library (http://fmipp.sourceforge.net). The online documentation of FUMOLA is available here: https://sourceforge.net/p/fumola/wiki/Home/ -
4
The Edge Machine Learning library
Machine learning algorithms for edge devices
Machine learning models for edge devices need to have a small footprint in terms of storage, prediction latency, and energy. One instance of where such models are desirable is resource-scarce devices and sensors in the Internet of Things (IoT) setting. Making real-time predictions locally on IoT devices without connecting to the cloud requires models that fit in a few kilobytes.These algorithms can train models for classical supervised learning problems with memory requirements that are... -
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.
-
5
Creates an index to DBF files using a B+ Tree; Cria um indice para um arquivo DBF usando uma arvore B+; Implementação em C; Baseada em Arquivo;
-
6
LEAN
Lean algorithmic trading engine by QuantConnect
Automated accounting for splits, dividends, and corporate events like delistings and mergers. Avoid selection bias with dynamically generated assets. Create and select asset universes on proprietary data and indicators. Automatically track portfolio performance, profit and loss, and holdings across multiple asset classes and margin models in the same strategy. Trigger regular functions to occur at desired times, during market hours, on certain days of the week, or at specific times of day.... -
7
CodilitySolutions
Solved training lessons from website codility.com
This project contains solutions for all training lessons that can be found on website codility.com: https://codility.com/programmers/lessons/ The solutions are written in programming language C, because I presumed that it is the most basic language anyone can easily understand and the fact that many other languages have a basis in C means the code can be easily rewritten in that language. -
8
Path Finder Qt
finds the sortest path on the square board. GUI is implemented in Qt.
The program demonstrates the usage of the A* algorithm to find the shortest path. It searches the shortest path between source piece and target piece on the rectangular board. On the board the obstacles (wall) can be constructed. In addition to the algorithm, the GUI is provided. The GUI is written in Qt. Using the GUI, one can construct and move interactively the obstacles on the board. For every modification of the board, the shortest path is calculated automatically. Some statistics... -
9
mstp-lib
RSTP / MSTP Library and Simulator - moved to GitHub
Project moved to GitHub. Check out the description there. https://github.com/adigostin/mstp-lib -
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.
-
10
TOL
Total Order Labeling for Reachability Queries on Large Dynamic Graphs
This is the code used in the following paper: Andy Diwen Zhu, Wenqing Lin, Sibo Wang, and Xiaokui Xiao. Reachability queries on large dynamic graphs: a total order approach. In Proceedings of the 2014 ACM SIGMOD international conference on Management of data (SIGMOD '14). Please cite the paper if you choose to use the code. -
11
Arageli is a C++ library for computations in arithmetic, algebra, geometry, linear and integer linear programming. Arageli provides routines and classes that support precise, i.e. symbolic or algebraic, computations.
-
12
OpenATOR
Axis Transformation Object Recognition
-
13
OpenANN
Basic Artificial Neural Network
OpenANN is a basic artificial neural network toolset. It is not being actively maintained. For performance neural networking, consider an alternative (such as https://sourceforge.net/projects/openann-project or https://www.tensorflow.org) -
14
CoRoPa stands for Computational Rough Paths. The aim of CoRoPa is to provide a software framework for various ideas related to Rough Path Theory, including rough differential equations and the digital description of serial data streams.
-
15
Lib Clock for GCC (C++)
Library Clock for GCC (C++)
Simple library that provides the basic features to perform the time calculation between two times provided. The code of this library is published in the book: C++ Underground Programmer of the author Augusto Manzano (only portuguese). The book can be purchased from the "Clube de Autores" service - https://clubedeautores.com.br/book/209155--C_Underground_Programmer?topic=compiladores#.WNfZkJt_aKY. For more libraries, go to: https://sourceforge.net/u/augustomanzano/profile. To see my curriculum vitae go to: http://lattes.cnpq.br/8184615061457853. ... -
16
Lib Roman/Arabic for GCC (C++)
Library Roman/Arabic for GCC (C++)
...This resource is developed with didactic and pedagogical objectives. Its commercial use may not be of extreme importance. The code of this library is published in the book: C++ Underground Programmer of the author Augusto Manzano (only portuguese). The book can be purchased from the "Clube de Autores" service - https://clubedeautores.com.br/book/209155--C_Underground_Programmer?topic=compiladores#.WNfZkJt_aKY. For more libraries, go to: https://sourceforge.net/u/augustomanzano/profile. To see my curriculum vitae go to: http://lattes.cnpq.br/8184615061457853. ... -
17
detectMITE
Detection of Miniature Inverted Repeat Transposable Elements
detectMITE - a MATLAB-based tool for detecting miniature inverted repeat transposable elements (MITEs) in genomes. [1] Who are we? Please visit website: http://bioinfolab.miamioh.edu [2] How to cite detectMITE? Ye C, Ji G, Liang C (2016) detectMITE: A novel approach to detect miniature inverted repeat transposable elements in genomes. Sci. Rep. 6, 19688. http://www.nature.com/articles/srep19688 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. ... -
18
CryptoLibraryRefImpl
encapsulates secure crypto algorithms for easy use
This library exposes security functionality to the programmer, such as random number generation, hashing, salted hashing, message authentication code, symmetric encryption, asymmetric encryption, hybrid encryption, digital signature and in-memory protection. The library is accompanied by a sophisticated reference implementation, that demonstrates how to make use of the CryptoLibrary. -
19
Hyacc is an efficient and practical Yacc/Bison-compatible full LR(1)/LALR(1)/LR(0) and partial LR(k) parser generator in ANSI C based on Knuth and Pager's LR(1) algorithms. Generated parser can be used in open-source or commercial software.
-
20
TommyDS is a C library of hashtables and tries designed for high performance.
-
21
MultiFast
Mass String Search and Replace Solution via Aho-Corasick Algorithm
Multifast provides you with efficient library and tool, to search and manipulate data streams on the fly. It can search for a huge number of strings and replace them in one pass. It contains a tidy and efficient implementation of the Aho-Corasick algorithm as a C library. -
22
Distant Speech Recognition
Beamforming and Speech Recognition Toolkit
BTK contains C++ and Python libraries that implement speech processing and microphone array techniques such as speech feature extraction, speech enhancement, speaker tracking, beamforming, dereverberation and echo cancellation algorithms. The Millennium ASR provides C++ and python libraries for automatic speech recognition. The Millennium ASR implements a weighted finite state transducer (WFST) decoder, training and adaptation methods. -
23
-
24
MicroGP
A multi-purpose extensible self-adaptive evolutionary algorithm
MicroGP (µGP, ugp) is a versatile optimizer able to outperform both human experts and conventional heuristics in finding the optimal solution of hard problems. It is an evolutionary algorithm since it mimics some principles of the Neo-Darwinian paradigm. ⚠️ A new version is available on https://github.com/squillero/microgp4 -
25
bs
A B-tree based sequence library.
BS is a data structures library. It features fixed data size, random access sequences. The sequences are constructed over B-trees. Complexity for most single item operations is about O(logN).
