Search Results for "c call tree"
Sort By:
Showing 23 open source projects for "c call tree"
View related business solutions-
Try Google Cloud Risk-Free With $300 in CreditUse your credit across every product. Compute, storage, AI, analytics. When it runs out, 20+ products stay free. You only pay when you choose to.
-
Auth0 B2B Essentials: SSO, MFA, and RBAC Built InAuth0's B2B Essentials plan gives you everything you need to ship secure multi-tenant apps. Unlimited orgs, enterprise SSO, RBAC, audit log streaming, and higher auth and API limits included. Add on M2M tokens, enterprise MFA, or additional SSO connections as you scale.
-
1
KACTL
KTH algorithm competition template library
...Instead of reinventing algorithms on the fly during contests like ACM-ICPC or Codeforces rounds, competitors can import exactly the component they need — whether a segment tree with lazy propagation, a minimum cost flow solver, or a fast Fourier transform — and focus their energy on problem logic and strategy. -
2
VR Paged List GXS for C++ and more ...
Paged Lists & Iterators GXS for C++ Sources by Vincent Radio {Adrix.NT
Vincent Radio {Adrix.NT} presents Paged Lists & Iterators GXS for C++ Sources by Vincent Radio {Adrix.NT} also contains - Little Docs about Paged Lists (docx, pdf) - VR Basic Common Utils Sources (Array List ...) - VR Generic Multi Dim Array Class - VR Generic MDArray List Mgr Class - VR Generic Adjacency (List | Matrix) Direct Graph Classes - VR List Interface with STL Support with some nice implementations (ArrayList, Paged-LIst) - Env Var Notes for sources for C++... -
3
MLPACK is a C++ machine learning library with emphasis on scalability, speed, and ease-of-use. Its aim is to make machine learning possible for novice users by means of a simple, consistent API, while simultaneously exploiting C++ language features to provide maximum performance and flexibility for expert users. * More info + downloads: https://mlpack.org * Git repo: https://github.com/mlpack/mlpack
-
4
Quadtree Demo
Demonstrates a quadtree for spatial indexing of triangles
This C++ demo allows users to interactively explore a quadtree's behavior. For this purpose the demo uses a quadtree data structure based on axis-aligned bounding boxes to speed up the search for triangles in a mesh. Depending on a search point all triangles of a quadtree's region are retrieved and relevant information about the search is shown. -
Gemini 3 and 200+ AI Models on One PlatformBuild, govern, and optimize agents and models with Gemini Enterprise Agent Platform.
-
5
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... -
6
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...
-
7
CLAW is a C++ Library providing various tools in different domains, like a Tweener framework, Bézier curves manipulation, a map with multiple value types, a binary search tree container implemented as an AVL and an implementation of the sockets as std::stream. The library also includes a set of classes to easily load and write png, jpeg, gif files and other image formats.
-
8
drvq
dimensionality-recursive vector quantization
drvq is a C++ library implementation of dimensionality-recursive vector quantization, a fast vector quantization method in high-dimensional Euclidean spaces under arbitrary data distributions. It is an approximation of k-means that is practically constant in data size and applies to arbitrarily high dimensions but can only scale to a few thousands of centroids. -
9
Evolving Objects
This project have been merged within Paradiseo.
See the new project page: https://nojhan.github.io/paradiseo/ (Archived project page: http://eodev.sourceforge.net/) -
Compliant and Reliable File Transfers Backed by Top Security CertificationsStop relying on non-certified, legacy file transfer tools that creak under the weight of modern security demands. Get full audit trails, advanced access controls and more supported by an award-winning team of experts. Start your free 25-day trial today.
-
10
"UltraQueue" is a library (DLL) project, written in C++. This library is intended to be used for very fast temporary data storage, aquired by any possible source (File, Serial Port, ...). Users can create multiple queues of differrent sizes & types
-
11
The ordered_tree class template is an implementation in C++ of the ordered tree data structure. It implements breadth, depth search, as well as child and leaf iterators. A single header file is needed to use the code.
-
12
A fully functional red-black tree implemented in C++/CLI with an OO approach of naming and structuring which makes the code highly readable as well as easily portable to C# or Java. The package also includes a binary search tree and two traversal algorithms.
-
13
An interactive binary search tree. The user may interact with the tree by performing rotations, balancing, insertions, and deletions. For educational purposes
-
14
Dictionary-tree is a standard dictionary, means a lexicographic tree (acyclic graph), where letters are nodes of tree, starting from root going down to leaves. You can Get and Add words, Clear and Save the whole dictionary. C++ and Pascal.
-
15
SphinxAIEngineis an open source AI engine. for researching morden AI technical. including for eg Bahviours Tree, Pathfinding .
-
16
ADTL is an Advanced Data structures Template Library written in C++. it includs sixteen kinds of stl-like contains, such as fibonacci heap,pariring heap,skew heap,avl tree,red-black tree,splay tree,skip list, unrolled linked list and so on.
-
17
Example how to use my class TPluginObject in C++Builder5 projects. Call *.bat, *.exe, *.vbs, *.hta, *.dll as plugins from application events or main menu. Create data base "PluginSampleDB" in MS SQL Server 2005 and Imort ActiveX : ScriptControl
-
18
This is a fully STL-compliant C++ map/set/multimap/multiset implementation for g++ using an AVL tree instead of a Red-Black tree (that is present in current libstdc++).
-
19
This is an avl tree implementation. It is implemented in very optimized way and easy to use. It does not force you to use any specific way of memory allocation. It does not use recursive call. It is implemented with emphasis on speed and simplicity.
-
20
It is the source code for a tree mining algorithm called TRIPS. It can mine frequent subtrees from a forest of tree structures.
-
21
spdict is a library of dictionary algorithms written in C++. It has support for sorted array, binary search tree, red-black tree, skip list, and balanced tree algorithms. Also include a cache class.
-
22
The tree control library is a C++ container library which stores generic types in tree structures. Three containers are available in the library: tree, multitree, and unique_tree. The library usage and syntax is much like that of the STL.
-
23
Provides fast lookup for a Subject Based messaging product using a trie. It allows for configurable wildcard characters to replace a single or multiple subject field(s) (A.B.*.D.>). Insertion in to the tree returns a unique handle for subsequent deletion
- Previous
- You're on page 1
- Next
