Search Results for "euclidean"
Sort By:
Showing 44 open source projects for "euclidean"
View related business solutions-
The All-in-One Commerce Platform for Businesses - ShopifyShopify is a leading all-in-one commerce platform that enables businesses to start, build, and grow their online and physical stores. It offers tools to create customized websites, manage inventory, process payments, and sell across multiple channels including online, in-person, wholesale, and global markets. The platform includes integrated marketing tools, analytics, and customer engagement features to help merchants reach and retain customers. Shopify supports thousands of third-party apps and offers developer-friendly APIs for custom solutions. With world-class checkout technology, Shopify powers over 150 million high-intent shoppers worldwide. Its reliable, scalable infrastructure ensures fast performance and seamless operations at any business size.
-
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.
-
1
Distances.jl
A Julia package for evaluating distances (metrics) between vectors
A Julia package for evaluating distances (metrics) between vectors. This package also provides optimized functions to compute column-wise and pairwise distances, which are often substantially faster than a straightforward loop implementation. -
2
Faiss
Library for efficient similarity search and clustering dense vectors
... that the instances are represented as vectors and are identified by an integer, and that the vectors can be compared with L2 (Euclidean) distances or dot products. Vectors that are similar to a query vector are those that have the lowest L2 distance or the highest dot product with the query vector. It also supports cosine similarity, since this is a dot product on normalized vectors. -
3
Flow Matching
A PyTorch library for implementing flow matching algorithms
... training. The library supports both continuous-time flows (via differential equations) and discrete-time analogues, giving flexibility in design and tradeoffs. It provides examples across modalities (images, toy 2D distributions) to help users understand how to apply flow matching in practice. The codebase includes notebooks illustrating 2D flow matching, discrete flows, and Riemannian flow matching on curved manifolds (e.g. flat torus) for non-Euclidean support. -
4
HomotopyContinuation.jl
A Julia package for solving systems of polynomials
HomotopyContinuation.jl is a Julia package for solving systems of polynomial equations by numerical homotopy continuation. Many models in the sciences and engineering are expressed as sets of real solutions to systems of polynomial equations. We can optimize any objective whose gradient is an algebraic function using homotopy methods by computing all critical points of the objective function. An important special case is when the objective function is the euclidean distance to a given point... -
Level Up Your Cyber Defense with External Threat ManagementMove beyond alerts. Gain full visibility, context, and control over your external attack surface to stay ahead of every threat.
-
5
moebinv
C++ libraries for manipulations in non-Euclidean geometry
These are two C++ libraries for symbolic, numeric and graphical manipulations in non-Euclidean geometry. There is GUI which allows to interact with these libraries by mouse clicks. On a dipper level the first library Cycle implements basic operations on cycles (quadrics) through FSCc construction. The second library Figure operates on ensembles of cycles connected by Moebius-invariant relations, e.g. orthogonality. Both libraries are based on the Clifford algebra capacities... -
6
Yaglom
Graphical User Interface to MoebInv libraries
This is an Interactive Geometry Package for non-Euclidean geometry. It is realised as a Graphical User Interface to MoebInv libraries. It allows a user to create and modify figures of interrelated cycles by mouse clicks. The same construction can be instantly re-implemented for any of nine Cayley–Klein geometries. Binary files are distributed in the main project Download section (https://sourceforge.net/projects/moebinv/files/). It is named after Soviet mathematician Isaak Moiseevich... -
7
MLPACK is a C++ machine learning library with emphasis on scalability, speed, and ease-of-use. Its aim is to make machine learning possible for novice users by means of a simple, consistent API, while simultaneously exploiting C++ language features to provide maximum performance and flexibility for expert users. * More info + downloads: https://mlpack.org * Git repo: https://github.com/mlpack/mlpack
-
8
Geodesy.jl
Work with points defined in various coordinate systems
Geodesy is a Julia package for working with points in various world and local coordinate systems. The primary feature of Geodesy is to define and perform coordinate transformations in a convenient and safe framework, leveraging the CoordinateTransformations package. Transformations are accurate and efficient and implemented in native Julia code (with many functions being ported from Charles Karney's GeographicLib C++ library), and some common geodetic datums are provided for convenience. -
9
GeomSpace
Interactive geometry software for Euclidean and non-Euclidean spaces
GeomSpace is interactive geometry software for different geometric spaces. You can build your own universe of any dimension and with any geometry. You can choose Euclidean, elliptic, hyperbolic, Galilean, Minkowskii, de Sitter among other spaces. -
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.
-
10
Euler
A distributed graph deep learning framework.
As a general data structure with strong expressive ability, graphs can be used to describe many problems in the real world, such as user networks in social scenarios, user and commodity networks in e-commerce scenarios, communication networks in telecom scenarios, and transaction networks in financial scenarios. and drug molecule networks in medical scenarios, etc. Data in the fields of text, speech, and images is easier to process into a grid-like type of Euclidean space, which is suitable... -
11
Reliable Metrics for Generative Models
Code base for the precision, recall, density, and coverage metrics
Reliable Fidelity and Diversity Metrics for Generative Models (ICML 2020). Devising indicative evaluation metrics for the image generation task remains an open problem. The most widely used metric for measuring the similarity between real and generated images has been the Fréchet Inception Distance (FID) score. Because it does not differentiate the fidelity and diversity aspects of the generated images, recent papers have introduced variants of precision and recall metrics to diagnose those... -
12
NOVA
Analysis and visualization of complexome profiling data.
NOVA is a program designed to analysis complexome profiling data (Heide et al., 2012). A graphical user interface (GUI) provides various visualization tools, such as heat maps and 2D plots. Several hierarchical clustering algorithms (e.g., single linkage, average linkage, Wards linkage), different distance measures (e.g., Euclidean distance, Manhattan distance, Pearson distance), and various normalization techniques are implemented. Many additional functions like zooming, searching for proteins... -
13
VividSTORM
Correlated confocal and SMLM data visualization and analysis
VividSTORM is a free and open-source standalone software with graphical user interface, for the correlated visualization and analysis of superresolution single molecule localization microscopy (SMLM) molecule lists and conventional pixel intensity-based images. The localization points (LPs) within this ROI can be analyzed using the selected built-in functions. NOTE: If you encounter issues not addressed by the user guide, please contact by message on this site or via e-mail for... -
14
Wykobi is an efficient, robust and simple to use multi-platform 2D/3D computational geometry library written in C++. Wykobi provides a concise, predictable, and deterministic interface for geometric primitives and complex geometric routines.
-
15
Matlab/Octave Rotations Library
Library for working with 3D rotations in Matlab/Octave
The Matlab/Octave rotations library is a collection of functions, bundled as m-scripts, that address computations and numerical handling of rotations in 3D Euclidean space. The rotation representations that are supported are rotation matrices (Rotmat), Quaternions (Quat), intrinsic ZYX Euler angles (Euler), fused angles (Fused) and tilt angles (Tilt). Operations such as composition, inversion, ZYX yaw extraction, fused yaw extraction, random generation, equality detection, vector rotation... -
16
Rotations Conversion Library
Library for working with 3D rotations in C++
The Rotations Conversion Library (RCL) is a collection of C++ functions that address common computations and numerical handling of rotations in 3D Euclidean space, including support for rotation matrices (`Rotmat`), Quaternions (`Quat`), intrinsic ZYX Euler angles (`Euler`), fused angles (`Fused`) and tilt angles (`Tilt`). In addition to the core competency of being able to convert between each of the representations, operations such as inversion, ZYX yaw extraction, fused yaw extraction... -
17
NNmapper
Perform short reads mapping
NNmapper constructs reference reads library and calculates the Euclidean distances between library reads and query reads. NNmapper can map a query read (1) to the library read that gives the smallest distance (most similar), (2) to the library read that gives the smallest distance while the distance is smaller than a threshold, or (3) all library reads that have distances smaller than threshold. NNmapper has high error-tolerant and is suitable for any read lengths. NN reports all mapping... -
18
(RoboSim) Robot Simulator
(RoboSim) Java based Robot Localization and Path Planner Simulator.
... Range Finder (Experimental) 3.Kalman Filter 4.Particles Filter 5.Path Planning 6.Path Smoothing 7.PID Controller Path Planning Algorithms 1.BFS 2.DFS 3.A Star 4. Dynamic Programming Heuristics i. Euclidean Distance ii. Euclidean Distance(+) iii. Euclidean Distance(*) iv. Euclidean Distance Squared v. Manhattan Distance vi. Chebyshev Distance -
19
HClust
Hierarchical clustering package
A simple java package to create clusters (in a tree form) of multi-dimensional data points based on euclidean distances. -
20
Fingerprint Recognition System
Fingerprint Recognition System 5.3 - Matlab source code
The proposed filter-based algorithm uses a bank of Gabor filters to capture both local and global details in a fingerprint as a compact fixed length FingerCode. The fingerprint matching is based on the Euclidean distance between the two corresponding FingerCodes and hence is extremely fast. We are able to achieve a verification accuracy which is only marginally inferior to the best results of minutiae-based algorithms published in the open literature. Our system performs better than a state... -
21
VectorCALC
Console vector analysis program
VectorCALC is a free console vector analysis program that performs calculations relating to 3 dimensional Euclidean vectors. Full features include: - Calculation of cross product - Calculation of dot product - Calculation of angle between vectors - Trigonometric functions on angle between vectors - Vector magnitude This program was written and compiled in C++, and supports Windows (Linux version under development). -
22
CVM C++ Class Library encapsulates concepts of vector and square, band, symmetric and hermitian matrices in Euclidean space of real and complex numbers. It utilizes BLAS and LAPACK Fortran libraries. See http://cvmlib.com for binaries and more details.
-
23
Incremental Mitosis code for paper: Rania Ibrahim, Naglaa Ahmed, Noha A. Yousri, Mohamed A. Ismail: Incremental Mitosis: Discovering Clusters of Arbitrary Shapes and Densities in Dynamic Data. ICMLA (1) 2012: 102-107. ---------------------------------------------------------------------------- To run Incremental Mitosis, please type the following in the command line: Java -jar incrementalMitosis.jar [f] [k] [inputFilename] [patternNumber] [distanceMethod(euclidean,cosine,pearson,KLD,jaccard...
-
24
...] [inputFilename] [patternNumber] [distanceMethod(euclidean,pearson)] [outlierHandlingUsage(0,1)] [outputFile] [draw(0,1)]
-
25
