Search Results for "data collection algorithm" - Page 9
Sort By:
Showing 306 open source projects for "data collection algorithm"
View related business solutions-
Simple, Secure Domain RegistrationRegister or renew your domain and pay only what we pay. No markups, hidden fees, or surprise add-ons. Choose from over 400 TLDs (.com, .ai, .dev). Every domain is integrated with Cloudflare's industry-leading DNS, CDN, and free SSL to make your site faster and more secure. Simple, secure, at-cost domain registration.
-
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.
-
1
PL/SQL Starter Framework
A boost or headstart to your PL/SQL development
!!! NOTE !!! The latest file upload (Simple.zip) is a simplified version of the Starter Framework meant for single-schema applications. It only offers logging, error handling and table-driven parameters (with a few extra supporting packages for writing to screen and file, and manipulating dates, strings and numbers). In order to access the simplified framework, click "Browse All Files" and choose the plsqlfmwksimplet folder, then the 2.1 folder. Download Simple.zip. The full framework... -
2
Mori
ClojureScript's persistent data structures and supporting API
Mori brings ClojureScript's efficient persistent data structures and functional APIs into vanilla JavaScript, enabling immutability and functional programming patterns with performant collections in JS. The installed package contains a single optimized JavaScript file mori.js. Load mori in your Node.js programs as you would any other module. For vectors and maps we provide efficient thaw and freeze operations. All Mori maps and sets support all the non-mutating methods of the proposed ES6... -
3
cubiculus
Examples of usage of cubiculus.com rest API
Project provide data object that could be used in API. There is also example of application that connect co API. -
4
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); [...] } -
Gen AI apps are built with MongoDB AtlasMongoDB Atlas is the developer-friendly database used to build, scale, and run gen AI and LLM-powered apps—without needing a separate vector database. Atlas offers built-in vector search, global availability across 115+ regions, and flexible document modeling. Start building AI apps faster, all in one place.
-
5
New CTruck3D Rally
Free-roaming 3D racing game featuring advanced terrain rendering
It's a free-roaming 3D racing game featuring advanced terrain rendering. For small file-size, a 4k x 4k terrain is available, sampled meter-by-meter so it's very smooth. Lightweight program. This is the form in which I wished to do the first release of the terrain rendering Algorithm I have developed throughout almost 2 years. Written in C++, featuring multithreading (2 threads): a total remake of the first 3D game I did years ago, CTruck3D_Simplex and sequels. This works better,... -
6
Algorithms & Data Structures in C++
Algorithms & Data structures in C++
An algorithm is represented by a .h file and placed under include. (one .header file per algorithm.) The demo program for the algorithm demonstration is placed under src. (one demo per algorithm.) After the program passes correctly, please initiate Pull Requests, the code is verified and stored in the library, and the new algorithm implementation is published in the README. TAB = 4 space. set ts=4 in vim. Graph output format is Graphviz Dot format. (the output format of the graph is in dot... -
7
Immutable Collections for Java
Immutable/Persistent Collections Library
...A utility class provides functional style algorithmic processing of Cursors including foldLeft, foldRight, collect, select, and reject. The 2-3 tree and integer trie classes are optimized for performance and can be used alongside java.util Collections when immutability is needed for safe data sharing. -
8
SpriteBuncher
A free, open-source texture packing program.
SpriteBuncher is a free, open-source texture packing program. It features an easy-to-use graphical interface, and advanced packing algorithms such as MaxRects. Further options include cropping, rotation, extruding, and padding. Data can be exported to a range of common output formats – e.g. Cocos2d, LibGDX, and Unity – or via generic XML, JSON, and plain text files. Examples and documentation are included. Source code available at: https://github.com/bazgt/SpriteBuncher [GPLv3]. -
9
MRA
A general recommender system with basic models and MRA
Multi-categorization Recommendation Adjusting (MRA) is to optimize the results of recommendation based on traditional(basic) recommendation models, through introducing objective category information and taking use of the feature that users always get the habits of preferring certain categories. Besides this, there are two advantages of this improved model: 1) it can be easily applied to any kind of existing recommendation models. And 2) a controller is set in this improved model to provide... -
Build Securely on Azure with Proven FrameworksMoving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
-
10
libcontc
Container library in C.
About Collection of data structures and operations that have been (and will continue to be) implemented in response to need. Container interface, naming and behavior is similar to the STL containers. Algorithm interface is in the spirit of the C standard library search and sort functions. Compatibility ISO C99, ISO C++98, ISO C++11. Performance These are designed to be general purpose, and reasonably efficient in most circumstances. -
11
Graphal
Graph algorithms interpreter, IDE, debugger, 3D visualizations.
Graphal is an interpreter of a programming language that is mainly oriented to graph algorithms. There is a command line interpreter and a graphical integrated development environment. The IDE contains text editor for programmers, compilation and script output, advanced debugger and visualization window. The progress of the interpreted and debugged graph algorithm can be displayed in 3D scene. -
12
ProximityForest
Efficient Approximate Nearest Neighbors for General Metric Spaces
A proximity forest is a data structure that allows for efficient computation of approximate nearest neighbors of arbitrary data elements in a metric space. See: O'Hara and Draper, "Are You Using the Right Approximate Nearest Neighbor Algorithm?", WACV 2013 (best student paper award). One application of a ProximityForest is given in the following CVPR publication: Stephen O'Hara and Bruce A. -
13
SPE Toolbox
MatLab functions for reading WinView/WinSpec .spe files
This toolbox is a collection of MatLab functions for reading WinView/WinSpec files (.spe extension) directly to MatLab. It provides functions for reading full header from file into a structure, reading frames into matrices, and reading pixel values across all frames. You can use these functions to analyse and process experiment data stored in .spe files in MatLab, and to write functions to export .spe files to animated GIFs for use in presentations. -
14
Collection of file-oriented tools implemented in java to perform common and specific file operations. Sample of common task: command-line file editor (cut, paste, append, etc). Sample of specific task: fix RAR archive with broken file header(s).
-
15
Clojure Cookbook
This is the home of O'Reilly's Clojure Cookbook
Clojure Cookbook is O'Reilly's editorial collection of Clojure “recipes” — curated pairs of common programming problems with idiomatic solutions, code examples, and explanations. It's designed to serve both as a tutorial and problem-solving reference in real-world Clojure development. Clojure Cookbook doesn't just teach you Clojure, it also shows you how to use the language and many of its common libraries. The most difficult part of mastering any language is knowing how to apply it, in an... -
16
bioluminescence
A java library for polymorphic genome assembly.
Bioluminescence is a java library for facilitating de novo genome assembly in the context of reads sampled from a single highly-polymorphic diploid individual. Bioluminescence implements a novel algorithm which uses an artificial neural network to classify contigs in a genome assembly as haplotype-specific or not-haplotype-specific. It then uses this information to partition the original input read set into two subsets, each of which has been enriched for one of the haplotypes. Initial results using this technique have dramatically improved de novo asseblies of such data. ... -
17
AlgART Java Libraries
Open source library for processing arrays and matrices
AlgART Java libraries for processing arrays and matrices are open-source product, distributed under MIT license. So, anyone can use them for free without any restrictions. Main features: 63-bit addressing of array elements (64-bit long int indexes), memory model concept (allowing storing data in different schemes from RAM to mapped disk files), wide usage of lazy evaluations, built-in multithreading optimization for multi-core processors, wide set of image processing algorithms over... -
18
Java generic Iterator implementation to generate permutations and combinations. Uses the algorithm described here http://en.wikipedia.org/wiki/Steinhaus%E2%80%93Johnson%E2%80%93Trotter_algorithm#Even.27s_speedup and the clear description of that algorithm here: http://www.cut-the-knot.org/Curriculum/Combinatorics/JohnsonTrotter.shtml
-
19
rmisockfactory
Collection of RMI Socket Factories
This project contains a collection of RMI socket factories -- for instance gzip-encoded data sent over the wire, NIO-based communication etc. -
20
Java/C Comparative Benchmarks
Java and C Comparative Performance Benchmarks
A collection of software benchmarks developed to compare the performance of Java with C on identical code. No language libraries were used to avoid implementation differences. Some of the benchmarks are also implemented in Python and Scala. There are benchmarks for bit twiddling, numerical computing, data structure manipulation, concurrent computing, callouts to native libraries, and, graphics processing units (GPU) utilization. -
21
MDSTk is a collection of 2D/3D image processing tools aimed at medical images. It contains routines for volume data processing (3D filtering, segmentation, etc.) as well as fast low-level vector graphics library for surface and tetrahedral meshing. MDSTk has been forked by 3Dim Laboratory s.r.o. to provide better support and further push its development forward.
-
22
dbtesma
efficient data generation for benchmarks and performance analysis
Highly efficient Data Generator for Benchmarks and Algorithm Performance Analysis. Supports fully configurable schemata as well as meta structures like Foreign Keys and Functional Dependencies. -
23
-
24
The Data Structure & Algorithm Library (DSAL) is a library of classical data structure and algorithm.
-
25
Sql Serializable Java Object Generator
Program used to generate Java objects which serialize to MySQL
This is an application that is used to graphically create a collection of objects which can reference each other. Once objects and their relationships are defined, you can serialize them into java classes which automatically serialize and deserialize to MySQL. This output can be used to speed up development of programs where data is persisted within a database. This program may one day be expanded to cover other languages and databases.
