Found 39 packages
Google Places, Maps, Roads, Search and Translate. Requests and Responses are complete with Google api documentation and references.
Find a closer word in a list of synonyms.
C# library for fast approximate nearest neighbours search using Hierarchical Navigable Small World graphs. Fork from original at https://github.com/microsoft/HNSW.Net, adds support for incremental build and MessagePack serialization.
Contains Support Vector Machines, Decision Trees, Naive Bayesian models, K-means, Gaussian Mixture models and general algorithms such as Ransac, Cross-validation and Grid-Search for machine-learning applications. This package is part of the Accord.NET Framework.
Dotnet wrapper over faisslib vector store (see https://github.com/facebookresearch/faiss). Currently only available for Windows x64. (Support for other platforms is possible).
Package Description
HNSWIndex provides a high-performance, approximate nearest-neighbor search solution using the HNSW data structure. It supports custom distance metrics, efficient searching with concurrency, and configurable parameters to balance speed, recall, and memory usage. Perfect for .NET applications that require fast similarity lookups (e.g., image retrieval, recommendation systems, or vector-based search).
Different methods to compare colors to a set of colours, and return the closest color
hnswlib: Header-only C++ library for fast approximate nearest neighbors
HNSW provides a high-performance, approximate nearest-neighbor search solution using the HNSW data structure. It supports custom distance metrics, efficient searching with concurrency, and configurable parameters to balance speed, recall, and memory usage. Perfect for .NET applications that require fast similarity lookups (e.g., image retrieval, recommendation systems, or vector-based search).
A Simple .NET Implementation of a KDTree for Nearest Neighbours searches with performances in mind.
A simple static library to find the nearest string in a list, and its edit distance, from a supplied string.
PCL Library to get nearest location information from a set of coordinates (lat/long).
Automatically adds Add(Singleton|Scoped|Transient) from your new class declaration into nearest DI registration point
FLANN is a library for performing fast approximate nearest neighbor searches in high dimensional spaces.
A very light mobile-friendly scroller with capabilities such as smooth touch scroll, snapping to nearest item, carousel, overflowing, and more.
Highly robust program takes your given measurement and converts it to the metric standard, then to all of the different measurements. Rounds measurements to 4 digits to the nearest even number.
Neo location search allows users to search nearest suburbs by geo location and distance.
ESP-kMeans is a fast and easy-to-use clustering library for text and numerical data, with efficient implementations of k-Means++ and Spherical k-Means++. It also provides an indexing structure for efficiently retrieving nearest neighbors based on the dot product.
PCL Library to get nearest location information from a set of coordinates (lat/long). Driven by NGeoNames and GeoNames.org data. This uses cross platform libraries underneath the hood, so be sure to install in your main iOS/Android/Windows projects as well