Search Results for "map it"
Sort By:
Showing 21 open source projects for "map it"
View related business solutions-
Build Agents and Models on One PlatformGemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
-
$300 Free Credits to Build on Google CloudPut your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
-
1
KrylovKit.jl
Krylov methods for linear problems, eigenvalues, and singular values
A Julia package collecting a number of Krylov-based algorithms for linear problems, singular value and eigenvalue problems and the application of functions of linear maps or operators to vectors. -
2
S2 Geometry
Computational geometry and spatial indexing on the sphere
...The library provides a robust mathematical framework for spherical geometry, allowing developers to work with polygons, points, and regions on the Earth’s surface using consistent and precise algorithms. Unlike traditional 2D geometry libraries, S2 ensures accuracy over large scales by modeling the globe directly, avoiding distortions caused by map projections. The project includes core C++ support, optional Python bindings, and integrations with Bazel and CMake for flexible builds. It relies on Abseil, OpenSSL, and googletest, and is tested across major platforms. -
3
Fractal Zoomer
A Fractal Zoomer with various functions.
An application that lets you render some of the most known fractal functions, like the Mandelbrot set and many more! It comes with alot of options to further enhance your fractal experience! Its easy to use and does not require installation. A java version higher than 1.8 is required to be installed. -
4
Pf4
Explore Thurston maps with four postcritical points
This program performs many computations for finite branched covers from the 2-sphere to itself with exactly four postcritical points. -
Demo Series - Small Business Backup By VeeamWatch this on-demand demo series and learn how to protect your Microsoft 365 data with clear, simple, actionable steps that are easy to implement for businesses of all sizes.
-
5
NAVAL-SEM
Award-winning open-source offline SEM platform for PLS-SEM & CB-SEM
NAVAL-SEM is an award-winning, free and open-source offline Structural Equation Modeling (SEM) platform supporting PLS-SEM and CB-SEM workflows. Designed for researchers, PhD scholars, professors, and analysts, it provides visual model building, measurement assessment, structural model analysis, and reproducible research workflows without subscriptions or cloud dependency. Features include: • PLS-SEM & CB-SEM • Bootstrapping, mediation, moderation & conditional process analysis • HTMT,... -
6
rethinking
Statistical Rethinking course and book package
This R package accompanies Richard McElreath’s Statistical Rethinking (2nd edition), offering utilities to fit and compare Bayesian models using both MAP estimation (quap) and Hamiltonian Monte Carlo via RStan (ulam). It supports specifying models via explicit distributional assumptions, providing flexibility for advanced statistical workflows. -
7
Hénon map browser
Program for exploring the Hénon attractor
A Python program for exploring the Hénon attractor. For an explanation of what the Hénon attractor is please see Wikipedia (http://en.wikipedia.org/wiki/H%C3%A9non_map). With this program you can draw the Hénon attractor and interact with it in various ways. You can zoom in by selecting an area, vary the Henon parameters manually and even make animations with them. The functionality is demonstrated in a Youtube video. There is a help function included that explains in more detail how to use... -
8
CLP Calculator
A calculator for solving problems using Constraint Logic Programming.
It is a simple calculator for solving problems using Constraint Logic Programming. Thanks to it, we can quickly see solution of: - Combinatory problem (Einstein's Riddle) - Scheduling problem (Museum of Art) - Optimization problems (Map Coloring) -
9
lottie vectors
Create, display and process 2D vectors in a 3D window.
...More exactly -displaying them in ways that hopefully will allow you to explore and better understand your vector data. The basic idea is simple, take a vector defined in one of a few different types of data formats and map it on the screen. Add another vector and you start to form a 'route'. Each route or position vector can be accompanied with a 'force' vector. This can be used to show something acting on a position with direction and magnitude. Finally you can give each position a tag to display on screen. This could be a common math symbol or greek letter, start/end signposts, or a number of the position either from the begining or after a reset. ... -
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.
-
10
MandelbrotExplorer
A program to calculate and represent the Mandelbrot set
This project is a C++ program to calculate and represent graphically the Mandelbrot fractal set, and/or the corresponding Julia sets, according to the seed Z0 given by the user as input. The user disposes of a graphical interface to control the program and modify conveniently some parameters, like the XY-scales, the XY map area, the Julia seed for the complex series iteration of Z(n+1)=Z(n)^2+a, being Z(0)=(X0,Y0) the seed, and "a in XY" the points to be calculated. The user can enter (among other parameters) the desired convergence-radius R for the series, and/or the number of maximal iterations N for the generator-equation in Z. -
11
Kohonen neural network library is a set of classes and functions for design, train and use Kohonen network (self organizing map) which is one of AI algorithms and useful tool for data mining and discovery knowledge in data (http://knnl.sf.net).
-
12
as3delaunay
Delaunay triangulation and Voronoi diagram for Flash Builder 4 project
...It is based on the well-known work of Raymond Hill and offers developers an efficient way to create and manipulate geometric structures for use in Flash and other AS3-based environments. The library enables users to generate Voronoi diagrams from a set of input points, allowing applications such as procedural map generation, image segmentation, and spatial partitioning. By handling complex geometric relationships automatically, it simplifies the process of building interactive or data-driven visualizations. The project emphasizes performance and mathematical accuracy while maintaining readability for developers working in ActionScript. Its codebase serves as a reliable foundation for anyone implementing geometry-based algorithms or graphical systems within AS3 projects. -
13
Truncated power series algebra
Truncated power series algebra
This project consists of two object-oriented implementations of truncated power series (TPSA) for arbitrary order and number of variables. Addition, subtraction, multiplcation, division, and exponentiation are all implemented in the algebra as overloaded operators. They can also compute with maps, a map being an array of TPSA objects representing a mapping of a space into itself. They are implemented as arrays of TPSA objects equal in number to the number of variables of the algebra. One implementation is written in Mathematica and is rather slow. The second is written in VB.net and is much faster. -
14
BP (Bilinear Pairing)
library for Bilinear Pairing
A library encapsulating bilinear pairing computation and group computation in the cyclic groups G_1, G_2, G_T. The bilinear pairing is a bilinear, non-degenerate map between G_1 and G_2 to an element in G_T. The users can build complex pairing-based software by the Pairing library without much knowledge of elliptic curves or pairing or number theory. The library is smaller than 57 Kbytes, suitable for hand held devices. The size is only 3.7% of the size of the BPC library. Maximum supported group size is 911 bits. ... -
15
Grafoanalizator
Graphanalyzer is an environment for visualization of graphsand process
...Learn more about program Graphanalyzer. Features: 1. About 20 algorithms. 2. Visualization of all the processes of graph processing. 3. Supporting helper function for graph creating as map. 4. Feedback. -
16
Algorithms that optimally & efficiently map atomic reactions. See 1) Atomic Reaction Mapping {Crabtree: amazon, b&n} 2) J. of Exp. Algorithmics, Vol 13 {Crabtree, Mehta} 3) J. Chem. Inf. Model., 2010, 50 (9), pp 1751–1756 {Crabtree, Mehta, Kouri}.
-
17
Platform independend, multithreaded fractal generator. Fine control over thread/CPU usage; unlimited precision; smooth/random/function coloring; supports color map files (over 1600 available); many image file formats. For any Java 1.5+ (32/64 Bit) VM.
-
18
This is a map internet web service based on a huge raster maps or satellite images for tracking and monitoring the mobile objects (cars etc) using GPS.
-
19
Java Kohonen Neural Network Library Kohonen neural network library is a set of classes and functions for design, train and use Kohonen network (self organizing map).
-
20
SNARLI (Simple Neural ARchitecture LIbrary) is a Java package containing a back-prop layer class and classes for the Self-Organizing Map and Incremental Growing Grid. The back-prop class supports sigma-pi connections and back-prop-through-time.
-
21
PGL is a C++/MFC/VC6 plot library. It is designed to plot lines, height map, vector fields, etc. Fully OOP. It comes as a DLL that is added to any existing MFC project.
- Previous
- You're on page 1
- Next
