Search Results for "set" - Page 2
Sort By:
Showing 109 open source projects for "set"
View related business solutions-
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.
-
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
libtdata
Libtdata is a C library implements trees, index allocation and bit ops
Libtdata is a small and portable C library implements a set of various search data structures, bit operations and index allocation. -
2
Omniglot
Omniglot data set for one-shot learning
This repository hosts the Omniglot dataset for one-shot learning, containing handwritten characters across multiple alphabets along with stroke data. It includes both MATLAB and Python starter scripts (e.g. demo.m, demo.py) to illustrate how to load the images and stroke sequences and run baseline experiments (such as classification by modified Hausdorff distance). The dataset provides both an image representation of each character and the time-ordered stroke coordinates ([x, y, t]) for each... -
3
bps
A B-tree based associative array library.
B-tree with a twist pointer set. The ordered set approaches the speed of the fastest unordered, hash table based sets, while using several times less memory. -
4
TARQUIN
MRS/NMR analysis software
Analysis software for MRS/NMR data. Allows processing and fitting to be performed in a fully automatic workflow. -
$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.
-
5
JavaGimmicks
Utility classes, APIs and tools for Java
A set of helper and utility classes, APIs and tools for the Java Programming Language. For more details - pleas visit the project homepage. -
6
Algorithm Database
Efficient Algorithms implemented in Java
The Aim of this project is to provide a collection of reusable Algorithms which can be used effectively in different scenarios. Algorithm implementations are in Java. Objective here is to implement algorithms which should be more efficient than the JDK implementation and also to create a platform for the researchers who works on Data Mining, Encryption algorithms, ect.. to collaborate and contribute to this project. -
7
Colibri - The ENVI / IDL Code Library
A collection of well documented ENVI / IDL algorithms and applications
...Both common code and classes are the building blocks for the applications which perform well delineated tasks. All common code, classes and applications are well documented. The complete set of code and documentation are available to the remote sensing community. ENVI/IDL code developers and remote sensing researchers are requested to actively contribute to this ENVI/IDL Code Library in order to obtain a solid reference of user developed applications for the remote sensing community. -
8
Opt4J
Modular Java framework for meta-heuristic optimization
Opt4J is an open source Java-based framework for evolutionary computation. It contains a set of (multi-objective) optimization algorithms such as evolutionary algorithms (including SPEA2 and NSGA2), differential evolution, particle swarm optimization, and simulated annealing. The benchmarks that are included comprise ZDT, DTLZ, WFG, and the knapsack problem. The goal of Opt4J is to simplify the evolutionary optimization of user-defined problems as well as the implementation of arbitrary meta-heuristic optimization algorithms. ... -
9
New Terrain and 3D Map System
a very lightweight advanced terrain-rendering and 3D map rendering sys
A very lightweight advanced terrain-rendering and 3D map rendering system. Minimal dependencies: OpenGL, SDL. It's distrib in 2-3 separate modules: 1. the C++ implementation of the terrain- and/or surface- rendering Algorithms I have developed: both a multithread and a non-multithread variant is relaeased. 2. Seme as at point 1. , but with a road-network rendering and collision-detection module I wrote before. It also adds some trees at the top of the terrain. (multitread vesion not... -
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.
-
10
owl reasoning over big biomedical data
A OWL reasoning framework for the analysis of big biomedical data
A general OWL reasoning framework for the analysis of big biomedical data and implement a MapReduce-based property chain reasoning prototype system. OWL reasoning method is ideally suitable for problems involved complex semantic associations because it is able to infer logical consequences based on a set of asserted rules or axioms. MapReduce framework isused to solve the problem of scalability. In our experiment, we focus on the discovery of associations between Traditional Chinese Medicine (TCM) and Western Medicine (WM). -
11
Bat2015
Bachelor of Science (Informatik)
...With a focus on the MILP methods we implement a load balancing and speed up the solving process in a multiplicative way. Sometimes we have super-linear speedup with a small set of hardware. With a splitting of problems, parallel computing and distributing the actual best solution to all running processes we solve CBP much faster than a sequential processing can do. -
12
InnoVB .NET Packager
Deploy VB.NET applications quick and easy
InnoVB .NET Packager is the easiest deployment tool for VB.NET applications via Inno Setup. It includes all the Application's dependencies even the COM libraries. Great for hybrid application projects. System Requirements: * .NET Framework 2.0 or later * Windows 2000 or later * 256Mb RAM or higher * 1GHz Processor or higher * Inno Setup 5 or higher NOTICE: Visual Basic .NET is a trademark of Microsoft. Inno Setup is a trademark of Jordan Russel. All trademarks are owned by their... -
13
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. -
14
Javascript-Voronoi
JS implementation of Fortune's algorithm to compute Voronoi cells
This repository implements Steven Fortune’s algorithm (sweep-line method) for generating Voronoi diagrams in JavaScript, providing a performant browser-side solution for computational geometry of planar point sets. With this library you can feed a set of sites (points) and compute their Voronoi cells – the partition of the plane into regions closest to each site – in O(n log n) time. It’s especially useful in web UIs, visualizations, interactive maps, and generative-art contexts where you need dynamic tessellations or diagrammatic layouts. The library exposes API functions for computing cells, retrieving neighbors, and drawing results into canvas or SVG. ... -
15
intzip
Fast compression of integer sets.
IntZip is a lossless compression algorithm for strictly increasing lists of unsigned integers. Compression means that a suitable list of integers can be encoded to a (whenever possible) shorter list of the same integer format. An arbitrary set of integers (i.e., a collection of unique numbers where the order does not matter) may be transformed into suitable input data by way of translation and sorting. The main focus of the algorithm is to encode structural characteristics of a given list, such as coherent intervals and repeated distances. Therefore, the quality of compression depends on diversity rather than size. ... -
16
S-Match
S-Match is a semantic matching framework.
S-Match is a semantic matching framework. S-Match takes any two tree like structures (such as database schemas, classifications, lightweight ontologies) and returns a set of correspondences between those tree nodes which semantically correspond to one another. S-Match contains implementations of the semantic matching, minimal semantic matching and structure preserving semantic matching algorithms. S-Match applies as a solution in many fields, including: information integration, ontology evolution and alignment, peer-to-peer information sharing, digital libraries integration, web service composition, agent communication, and query answering on the web. ... -
17
A set of software tools useful for building, testing, and exercising web services (and other interfaces) for the travel industry which comply with the specifications of the Open Travel Alliance (OTA). This project is initiated by members of the OTA.
-
18
msp
mathSuite Speed & Matrix Stream Processor
This program is fundamentally a short-sized version of my mathSuite program: https://sourceforge.net/projects/mathsuite/ It includes all the functionalities of MSCenv (mathSuite Calculus Environment), such as inline variables and functions (mainly thanks to ExprEval), which you can use to perform expensive complex computations and store their results into runtime variables. You can perform also every Linear Algebra Operations included in mathSuite with new optimizations. -
19
libcpr
Public domain backport of the core C++11 standard library to C.
Backport of C++11's std::string and std::vector to C. Other containers such as std::list, std::map, and std::set are in the works. -
20
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 counting * several list processing functions like iterators and map-reduce * support of [Ideal Hash Tries](http://infoscience.epfl.ch/record/64398/files/idealhashtrees.pdf) for highly efficient hash map data structures * parsers for [JSON](http://json.org) data and the text configuration files found in Unix system * doubly linked circular lists for reliable event queues * support for test and debugging of memory management problems such as memory leaks -
21
Algorithms & Data Structures in C++
Algorithms & Data structures in C++
...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 of graphviz.) -
22
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 controllable adjustment range, which thereby makes it possible to provide optional modes of recommendation aiming different kinds of users. -
23
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. Finally, a part of the library is devoted to artificial intelligence in games and includes a generic alpha-beta algorithm. Each module is provided with an example program.
-
24
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. -
25
FFT for ARMv6
Fixed point 16/32 integer FFT library for the Raspberry Pi and Android
This library is being created as I have a need to do very fast FFTs on low end devices not supporting the NEON instruction set. The Raspberry Pi is an ideal candidate for developing in gcc before porting to JNI for low spec Android devices, hence it's inclusion. Fixed point 16/32 integer FFT library suitable for the Raspberry Pi and Android devices. Includes test stubs for gcc on the Raspberry Pi and a Basic4Android wrapper from JNI. It includes hand optimised ARMv6 assembler, demonstrating techniques such as pipeline stuffing to achieve maximum performance. ...
