Search Results for "algorithms" - Page 15
Sort By:
Showing 1620 open source projects for "algorithms"
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.
-
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
Tiramisu
Polyhedral compiler for expressing fast and portable data algorithms
Tiramisu is a compiler for expressing fast and portable data parallel computations. It provides a simple C++ API for expressing algorithms (Tiramisu expressions) and how these algorithms should be optimized by the compiler. Tiramisu can be used in areas such as linear and tensor algebra, deep learning, image processing, stencil computations and machine learning. The Tiramisu compiler is based on the polyhedral model thus it can express a large set of loop optimizations and data layout... -
2
Simd
High performance image processing library in C++
The Simd Library is a free open source image processing library, designed for C and C++ programmers. It provides many useful high performance algorithms for image processing such as: pixel format conversion, image scaling and filtration, extraction of statistic information from images, motion detection, object detection (HAAR and LBP classifier cascades) and classification, neural network. The algorithms are optimized with using of different SIMD CPU extensions. In particular the library... -
3
RPnP-C++
RPnP C++ implemention
I have written the code of RPnP available at http://xuchi.weebly.com/uploads/5/6/7/3/5673896/rpnp1.0.zip in C++ with the help of OpenCV -
4
Pascal libraries and components. Library for: Matrix, Matrix Math, Math & statistic, CSV, URL, Counters, dir/file scanning, file/string/… utils, progress bar, … Components: DataList, Line oriented reports, Gauge, Syllable (Italian), …
-
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.
-
5
Physhun is a Java framework for building and executing finite state machines in J2SE and J2EE environments. State models are defined as collections of Spring beans, and do not use proprietary modeling languages. The framework is simple and flexible.
-
6
glint
A tool for finite state machine analysis and synthesis.
glint is a tool facilitating you in development of state-oriented control entities which supposed to be used in very broad areas of programming (e.g. state-oriented network protocols). glint saves you from pondering how your finite state machine should be organized, how many states it should have and what they should mean. You just tell glint how you would like your control entity to operate and glint returns to you the synthesised magic black box which implements the desired... -
7
FastFlow: programming multi-core
Pattern-based multi/many-core parallel programming framework
FastFlow is a C/C++ programming framework supporting the development of pattern-based parallel programs on multi/many-core, GPUs and distributed platforms. FastFlow run-time is built upon non-blocking threads and lock-free queues. Thanks to its very efficient CAS-free communication/synchronization support (e.g. few clock cycles core-to-core latency), FastFlow effectively supports the exploitation of fine grain parallelism, e.g. parallel codes managing very high frequency streams on... -
8
Douya Bean sprouts
A Material Design app for douban.com
..., and the usage of Douban is naturally different. Douban is used to obtain information, but whether the acquisition of information is based on entries and algorithms, or based on neighbors and people, this issue has probably remained unresolved in the multiple revisions of Douban. Douban Broadcasting has been one of the few Android Design applications in China a few years ago. Actively express the characteristics of Douban, such as broadcasting, neighbors, Douyou, etc. -
9
TEESer
Tool for Engineering Emergent Selforganizing bEhavioR
... to use their domain tools such as favorable simulator and by pluging it into the framework can take advantage of distributed simulations in the grid, various analyzers, optimizers (particle swarm optimization, genetic algorithms, ...). See Wiki pages for more information. -
Get the most trusted enterprise browserDefend against security incidents with Chrome Enterprise. Create customizable controls, manage extensions and set proactive alerts to keep your data and employees protected without slowing down productivity.
-
10
SODLS
Self-orthogonal diagonal Latin squares.
Makes self-orthogonal diagonal Latin squares, SODLS, for all valid orders, (that is, not order 2, 3, or 6). Input is an order, (one number), or an order range, (two numbers separated by white space). Output files are in folder SODLS[_n]. Each file contains a SODLS followed by a magic square. The magic square, M, is made from the order N SODLS, Q, and its transpose, as: M[row][col] = N x Q[row][col] + Q[col][row] + 1 See http://budshaw.ca/SODLS.html ... -
11
STXXL is an implementation of the C++ standard template library STL for external memory (out-of-core) computations, containers, and algorithms that can process huge volumes of data that only fit on disks.
-
12
Face Recognition
World's simplest facial recognition api for Python & the command line
Face Recognition is the world's simplest face recognition library. It allows you to recognize and manipulate faces from Python or from the command line using dlib's (a C++ toolkit containing machine learning algorithms and tools) state-of-the-art face recognition built with deep learning. Face Recognition is highly accurate and is able to do a number of things. It can find faces in pictures, manipulate facial features in pictures, identify faces in pictures, and do face recognition... -
13
cocolib / light field suite
CUDA library for continuous optimization and light field analysis
Library for continuous convex optimization in image analysis, together with a command line tool and Matlab interface. Implements several recent algorithms for inverse problems and image segmentation with total variation regularizers and vectorial multilabel transition costs. Also included is a suite for variational light field analysis, which ties into the HCI light field benchmark set and givens reference implementations for a number of our recently published algorithms. *** NOTE... -
14
The source code has been migrated and is now hosted on Github: https://github.com/jenetics/jenetics Jenetics is an advanced Genetic Algorithm, Evolutionary Algorithm and Genetic Programming library, respectively, written in modern day Java. It is designed with a clear separation of the several algorithm concepts, e. g. Gene, Chromosome, Genotype, Phenotype, Population and fitness Function. Jenetics allows you to minimize or maximize the given fitness function without tweaking it. In...
-
15
SMSD
SMSD is a Java based software library for calculating MCS.
SMSD is a Java based software library for calculating Maximum Common Subgraph (MCS) between small molecules. This will help us to find similarity/distance between two molecules. MCS is also used for screening drug like compounds by hitting molecules, which share common subgraph (substructure). -
16
DRAKON Editor
A free cross-platform editor for the DRAKON visual language.
... DRAKON Editor to build algorithms in Go, Java, Processing.org, D, C#, C, C++, Python, Tcl, Javascript, Erlang and Lua. -
17
TextTeaser
TextTeaser is an automatic summarization algorithm
textteaser is an automatic text summarization algorithm implemented in Python. It extracts the most important sentences from an article to generate concise summaries that retain the core meaning of the original text. The algorithm uses features such as sentence length, keyword frequency, and position within the document to determine which sentences are most relevant. By combining these features with a simple scoring mechanism, it produces summaries that are both readable and informative.... -
18
JPPF
The open source grid computing solution
JPPF makes it easy to parallelize computationally intensive tasks and execute them on a Grid. -
19
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. -
20
DistAlgo
A Language for Distributed Algorithms
DistAlgo is a very high-level language for expressing distributed algorithms. -
21
Edward
A probabilistic programming language in TensorFlow
.... It enables features such as computational graphs, distributed training, CPU/GPU integration, automatic differentiation, and visualization with TensorBoard. Expectation-Maximization, pseudo-marginal and ABC methods, and message passing algorithms. -
22
Intel neon
Intel® Nervana™ reference deep learning framework
neon is Intel's reference deep learning framework committed to best performance on all hardware. Designed for ease of use and extensibility. See the new features in our latest release. We want to highlight that neon v2.0.0+ has been optimized for much better performance on CPUs by enabling Intel Math Kernel Library (MKL). The DNN (Deep Neural Networks) component of MKL that is used by neon is provided free of charge and downloaded automatically as part of the neon installation. The gpu... -
23
Various tools for automating some trading operations on the most popular cryptocurrency exchanges.
-
24
Charting tools, backtesting tools, and data visualization tools for the most popular cryptocurrencies.
-
25
TSP Solver and Generator
Generate and solve Travelling Salesman Problem tasks
TSPSG is intended to generate and solve Travelling Salesman Problem (TSP) tasks. It uses Branch and Bound method for solving. An input is a number of cities and a matrix of city-to-city travel prices. The matrix can be populated with random values in a given range (useful for generating tasks). The result is an optimal route, its price, step-by-step matrices of solving and solving graph. The task can be saved in internal binary format and opened later. The result can be printed or saved as...
