Search Results for "data mining algorithms in c#.net" - Page 6
Sort By:
Showing 271 open source projects for "data mining algorithms in c#.net"
View related business solutions-
AI-powered service management for IT and enterprise teamsGive your IT, operations, and business teams the ability to deliver exceptional services—without the complexity. Maximize operational efficiency with refreshingly simple, AI-powered Freshservice.
-
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.
-
1
Linear Program Solver
Solve linear programming problems
Linear Program Solver (LiPS) is an optimization package oriented on solving linear, integer and goal programming problems. The main features of LiPS are: ● LiPS is based on the efficient implementation of the modified simplex method that solves large scale problems. ● LiPS provides not just an answer, but a detailed solution process as a sequence of simplex tables, so you can use it for studying/teaching linear programming. ● LiPS gives sensitivity analysis procedures, which allow us to... -
2
Math tools in Python to tackle down problems in Operational Research fields. Comes with a Django based web interface to allow remote access to complex simulation means.
-
3
QVision: Computer Vision Library for Qt
Computer vision and image processing library for Qt.
This library contains among other things a set of graphical widgets for video output, performance evaluation and augmented reality. The library also provides classes for several data types usually required by computer vision and image processing applications such as vectors, matrices, quaternions and images. Thanks to a large number of wrapper functions these objects can be used with highly efficient functionality from third party libraries such as OpenCV, GNU Scientific Library... -
4
A capsule tree is a general purpose, self-balancing tree data structure for large, ordered, data-sets. It is designed to provide the same characteristics as B-trees and B+trees, but built from the ground up for in-memory usage. In other words, there are no provisions for “slow” I/O cases. The original motivation for this tree was a better backend for memory managers. However, the end result was a new sub-category of trees. The implementation giving here is just one implementation...
-
Sales CRM and Pipeline Management Software | PipedrivePipedrive’s simple interface empowers salespeople to streamline workflows and unite sales tasks in one workspace. Unlock instant sales insights with Pipedrive’s visual sales pipeline and fine-tune your strategy with robust reporting features and a personalized AI Sales Assistant.
-
5
-
6
libfgen
Library for optimization using a genetic algorithm or particle swarms
libfgen is a library that implements an efficient and customizable genetic algorithm (GA). It also provides particle swarm optimization (PSO) functionality and an interface for real-valued function minimization or model fitting. It is written in C, but can also be compiled with a C++ compiler. Both Linux and Windows are supported. -
7
WAGL is a cross-platform, object-oriented video game development library. It aims to not only include simple access to the target system's UI, but also a fairly comprehensive library of commonly used data structures and algorithms for game development.
-
8
The Data Structure & Algorithm Library (DSAL) is a library of classical data structure and algorithm.
-
9
WPF Code Generator
Word List Generator for Windows
This a .net 4.5 WPF application that generates word lists, similar to crunch for linux. Just one nifty multi-threaded dictionary / code / word - list generator. It is a permutation combination engine, so it is perfect for brute force activities. Please show your appreciation and leave a review or comment, so I can find the motivation to improve it. -
Crowdtesting That Delivers | TesteumTesteum connects your software, app, or website to a worldwide network of testers, delivering detailed feedback in under 48 hours. Ensure functionality and refine UX on real devices, all at a fraction of traditional costs. Trusted by startups and enterprises alike, our platform streamlines quality assurance with actionable insights.
-
10
Sorting Algorithms
Searching and Sorting algorithms
Selection Sort, Quick Sort, Merge Sort, etc Data analysis and efficiency. -
11
A Library to calculate smooth lines in 2D and 3D. Given some polyline, a finer segmented polyline is generated. The smoothed line may hit the original points or its length may be equal to the original length. Linear equations solvers are also provided.
-
12
AlgDomes
Algorithms in Data Structures
--> Now available in English! Click "Browse All Files" to get it. <--- AlgDomes is a free, open source, educational application, designed to visually project and explain known algorithms in data structures. Designed & Created by: Konstantinos Kourmousis and Pavlos Paschalidis. ====================================== Η εφαρμογή AlgDomes είναι μια δωρεάν, ανοιχτού κώδικα εκπαιδευτική εφαρμογή οπτικοποίησης και επεξήγησης γνωστών αλγορίθμων σε δομές δεδομένων. Δημιουργήθηκε από... -
13
Galois sub-hierarchy builder
Visualize Galois sub-hierarchy of 2d matrix
... and Alain Sigayret In you're in need of other GSH algorithms or their realizations in C++, you might want to investigate a project called Galicia on sourceforge. This program is free software and is licensed under GNU General Public License as published by the Free Software Foundation. Only jre7 compliant at the moment. -
14
OSM Explorer
Basic routing and spatial functions using OpenStreetMap data
A mapping application for OpenStreetMap that renders OSM or MapQuest tiles and does basic routing from a built-in database. The main focus of this project is the development of a high-performance routing engine that can handle a variety of routing and vehicle constraints on demand without additional pre-processing of the road network. An additional goal is the development of a class library centered around a built-in, object-oriented database used for processing and storing OSM map data... -
15
makingMazes
Creator of mazes, with a recursive algorithm homemade (I'm not mathema
The algorithm will carving zeros in an integer array initialized to "1". Data can be recorded in a simple way. -
16
Project provides a set of concurrent building blocks (Java & C/C++) that can be used to develop parallel/multi-threaded applications. Components are grouped into 4 categories: 1.Data Structures 2. Parallel Patterns 3.Parallel functions 4.Atomics and STM
-
17
DataUsagePrinter
Creates printable string of data usage
A simple utility which creates a printable string of data usage. E.g. supply the value 1234567890 and DataUsagePrinter will return the string "1GB 153MB 384KB 722B". Available as binary and source downloads for Java and C#. -
18
A library of standard data structures in C, similar to STL in C++. Includes variable-length arrays, deques, hashtables, avl trees, binary heaps, and many other useful structures, with a simple and intuitive interface.
-
19
fqpack
FASTQ compression
Provides bitwise, context-based 2nd generation data compression for large FASTQ-based files -
20
ChecksumValidation
Validation of IBANs, bank accounts, credit cards, identity cards
ChecksumValidation is a framework for validation of international bank accounts (IBAN), credit card numbers, german identity cards, german passports and for german bank accounts. Validation is performed by computing checksums. Checksums for german bank accounts are maintained and documented by www.bundesbank.de. In sum, ChecksumValidation implements round about 150 algorithms. It may freely be used under GNU GPLv3 licence (see below). ChecksumValidation is implemented in Microsoft .NET... -
21
gpufsknn
A GPU-based efficient data parallel formulation of the kNN problem
A GPU-based efficient data parallel formulation of the k-Nearest Neighbor (kNN) search problem which is a popular method for classifying objects in several fields of research, such as- pattern recognition, machine learning, bioinformatics etc. -
22
"UltraQueue" is a library (DLL) project, written in C++. This library is intended to be used for very fast temporary data storage, aquired by any possible source (File, Serial Port, ...). Users can create multiple queues of differrent sizes & types
-
23
BlueDS is a library that contains the implementation of frequently used data structures and algorithms in Computer Science. BlueDS is designed to be fast and efficient.
-
24
SPLITNEURON is a completely new approach to large-scale, biologically plausible, neural-network simulation library based on data structures and methods directly coded into database and conceived to explicitly share load on multiple machines.
-
25
ExtraDix is a sorting algorithm based on Radixsort. It is faster than Quicksort, stable, realized in C and can sort by any basic data type. Testing was done with 1 million data records sorting char, short, int, long, float, double and strings.
