With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.
You 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.
Try free now
D&B Hoovers is Your Sales Accelerator
For sales teams that want to accelerate B2B sales with better data
Speed up sales prospecting with the rich audience targeting capabilities of D&B Hoovers so you can spend more sales time closing.
TinyCrypt is a simple secure program for encrypting files. The core encryption code is only 76 lines of C code, based on the well known ARC4-D(768) algorithm.
1.) Investigation with cosine transform, and anti transform algorithm, with some voice recognition code. 2.) Translator: Croatian, English. 3.) 2D to 3D picture algorithm (principle) and new 2Dto3D video conversion code with AviSynth video scripting
Developed as a final year project at Islamic University of Technology (IUT) during 2010 - 2011 academic year. This code is a simple implementation of real coded genetic algorithm for numerical optimization. Code is written in C/C++.
Say goodbye to broken revenue funnels and poor customer experiences
Connect and coordinate your data, signals, tools, and people at every step of the customer journey.
LeanData is a Demand Management solution that supports all go-to-market strategies such as account-based sales development, geo-based territories, and more. LeanData features a visual, intuitive workflow native to Salesforce that enables users to view their entire lead flow in one interface. LeanData allows users to access the drag-and-drop feature to route their leads. LeanData also features an algorithms match that uses multiple fields in Salesforce.
Brute is a brute force hash cracker, it allows the user to specify how many threads he want running simultaneously. It is fast, and modular, all the hash algorithm dependent code lies in a module (a shared library). Modules available: MD5; SHA256; SHA512
MeMo (stands for Meta-Model) is planned as Generic Programming Language & IDE, as flexible & smart as it is possible for computer application, including adjustable syntax, algorithm reduction. Ideally, it has to contain AI for interacting with the user.
This project is about an algorithm for multi-resolution texture systhesis on Cell.BE.There are there source code files.One is serial on x86.One is serial code on cell ppu,and the last is parallel code,which use ppu and 8 spus.
N-body implementation of two important algorithm : Tree-code (Barnes-Hut) and FMM (Fast multipole Method). We provide this two algorithm with a new data structure named compressed_octree.
Secure and customizable compute service that lets you create and run virtual machines.
Computing infrastructure in predefined or custom machine sizes to accelerate your cloud transformation. General purpose (E2, N1, N2, N2D) machines provide a good balance of price and performance. Compute optimized (C2) machines offer high-end vCPU performance for compute-intensive workloads. Memory optimized (M2) machines offer the highest memory and are great for in-memory databases. Accelerator optimized (A2) machines are based on the A100 GPU, for very demanding applications.
Csolve is a constraint solver compiler. It compiles a set
of constraints into an arc-consistency algorithm.
Generated output is in the C language and can be linked
with existing code. Csolve
also contains libraries for standard instantiation method
A human-readable ISC-Licensed implementation of the LZO1X algorithm.
...The main problem with LZO is that it is absolutely not human readable.
People have done crazy stuff to get LZO to run in their language. Usually it implies inline assembly or trying to execute data which actually contains machine code. This is sick. Whoever is responsible for this sorry situation ought to be ashamed.
So I'm going to deobfuscate LZO and provide a ISC implementation of this algorithm in Python and C. In addition, I will provide a textual description of the algorithm so that it can be easily ported to any programming language.
I expect a severe performance degradation, but I leave optimizing for speed to other people.
Fast-Fourier-Transform-based number theory code to test Mersenne numbers for primality using the Lucas-Lehmer test and the Crandall-Fagin irrational-base discrete weighted transform (IBDWT) algorithm (Math. Computation 62 (205), pp.305-324, January 1994)
...You can upload a better modified version and improove this article by contacting me. With some pin changes you can port this code to other arduino boards.