Search Results for "data collection algorithm" - Page 40
Sort By:
Showing 1337 open source projects for "data collection algorithm"
View related business solutions-
$300 Free Credits to Build on Google CloudStart your next project with $300 in free Google Cloud credit. Spin up VMs, run containers, query petabytes in BigQuery, or build agents with Gemini Enterprise Agent Platform. Once your credits are used, keep building with 20+ always-free tier products including Compute Engine, Cloud Storage, GKE, and Cloud Run functions. No commitment required—just sign up and start building.
-
Custom VMs From 1 to 96 vCPUs With 99.95% UptimeLive migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
-
1
KALIMAT Multipurpose Arabic Corpus
A corpus that could be of help for researchers working on Arabic NLP
KALIMAT a Multipurpose Arabic Corpus We are pleased to announce the immediate availability of KALIMAT 1.0, KALIMAT is an Arabic natural language resource that consists of: 1) 20,291 Arabic articles collected from the Omani newspaper Alwatan by (Abbas et al. 2011). 2) 20,291 Extractive Single-document system summaries. 3) 2,057 Extractive Multi-document system summaries. 4) 20,291 Named Entity Recognised articles. 5) 20,291 Part of Speech Tagged articles. 6) 20,291 Morphologically Analyse articles. The data collection articles fall into six categories: culture, economy, local-news, international-news, religion, and sports. The process of creating KALIMAT was applied to the entire data collection (20,291 articles). -
2
A collection of classes and facilities targeted at any kind of communication / presentation, from user interfaces to information kiosks to data-mining.
-
3
qure
software for viral quasispecies reconstruction from next-gen seq. data
QuRe is a program for viral quasispecies reconstruction, specifically developed to analyze long read (>100 bp) NGS data. The software performs alignments of sequence fragments against a reference genome, finds an optimal division of the genome into sliding windows based on coverage and diversity and attempts to reconstruct all the individual sequences of the viral quasispecies--along with their prevalence--using a heuristic algorithm, which matches multinomial distributions of distinct viral variants overlapping across the genome division. ... -
4
CactiFans
CactiFans is a self installing based off CentOS customized Cacti
...Everything is designed to be completely automated and working directly out of the box. This compact distro is loaded with extra features such as Syslog and Netflow data collection, Weathermaps, Reports, Auto Discovery, Nagios, and much more! -
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.
-
5
Data Entry Form
A program for data collection of pen and pencil forms.
Data Entry Form is a program for data collection of pen and pencil forms. It's mainly intended for market research. -
6
VideoDB is a database to manage your personal video collection. It uses PHP and MySQL and features fetching Movie data from the Internet Movie Database (IMDb). videoDB has now moved to its new home at http://github.com/andig/videodb
-
7
DeNovoCheck
DeNovoCheck: Inheritance analysis for NGS trio data
DeNovoCheck is intended to be used for inheritance analysis in NGS tio data. For rare dominant Mendelian diseases, patient-parent trios are often used to reduce the number of candidate variants. The algorithm bases the inheritance prediction on the data available in the parental BAM files and allows for a fast and reliable selection of potential de novo variants. -
8
jcdbrowser
browser for managing classical CD collection
jCDBrowser is a JAVA based program for managing a collection of CDs with Classical music, using a fully integrated hsql database. -
9
MapPSO is a tool for Ontology Alignment, which uses Discrete Particle Swarm Optimisation. A particle swarm is used to search for the optimal alignment. The algorithm is massively parallel and adapts naturally on parallel architectures.
-
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.
-
10
An important tool for Algorithm Visualization (AV) developers is a repository of good examples of existing AVs, including source code. The goal of this site is to build a collection of AV implementations from a variety of developers in the AV community.
-
11
The Data Structure & Algorithm Library (DSAL) is a library of classical data structure and algorithm.
-
12
quick-json parser
parse/generate json the way you want quickly. configure/validate json
- quick-json features - # Compliant with JSON specification (RFC4627) # High-Performance JSON parser # Supports Flexible/Configurable parsing approach # Configurable validation of key/value pairs of any JSON Heirarchy # Easy to use # Very Less foot print # Raises developer friendly and easy to trace exceptions # Pluggable Custom Validation support - Keys/Values can be validated by configuring custom validators as and when encountered # Validating and... -
13
The Prajna project is a collection of tools and utility classes combining visualization, geographic displays, data fusion, and semantic reasoning into a cohesive toolkit for enhancing information discovery and reasoning.
-
14
segment
Solve the Viterbi algorithm in a data stream
It is often necessary to assign a series of discrete values to continuosly variable data sequenced by time, position, etc., thereby parsing the data into fewer and larger segments of variable width. The 'segment' utility takes an input data stream as a Hidden Markov Model and applies the Viterbi algorithm to find the most likely segmentation path through the data. -
15
Robust Correlation Toolbox
Free Matlab toolbox to compute robust correlations
The Robust Correlation Toolbox is a free collection of Matlab functions allowing to visualize data in univariate and bivariate space, check assumptions of normality and homoscedasticity and compute Pearson's and Spearman's, percentage bend, and skipped correlations with bootstrapped confidence intervals - see http://www.frontiersin.org/Quantitative_Psychology_and_Measurement/10.3389/fpsyg.2012.00606/full -- code moved to https://github.com/CPernet/robustcorrtool -
16
MolBioLib
C++11 framework for rapid develop and deploy of bioinformatic tasks.
MolBioLib is a compact, portable, and extensively tested C++11 software framework and set of applications tailored to the demands of next-generation sequencing data and applicable to many other applications. MolBioLib is designed to work with common file formats and data types used both in genomic analysis and general data analysis. A central relational-database-like Table class is a flexible and powerful object to intuitively represent and work with a wide variety of tabular datasets, ranging from alignment data to annotations. ... -
17
EmployeesProfileViewer is my MSc final project. Consists of an application to represent the employees of an organization in a graphic map according to personal skills, using their evaluations on the different competences which the company needs. This software generates a graphical representation of the employees in a 2D map of coordinates, that pojects each worker as a figure in the map. The geometric characteristics of each one of these shapes will tell us how are the skills of the...
-
18
pyisocalc
Isotopic pattern calculator in python 2.x
This is an isotopic pattern calculator written in python. It depends on re, sys, numpy, operator, itertools, and matplotlib. -
19
MCC-LIDAR
Multiscale Curvature Classification for LIDAR Data
MCC-LIDAR is a C++ application for processing LiDAR data in forested environments. It classifies data points as ground or non-ground using the Multiscale Curvature Classification algorithm. -
20
smooth
Wavelet smoothing in a data stream
It is often necessary to smooth high frequency fluctuations out of data streams sequenced by time, position, etc. The 'smooth' utility applies such smoothing using the wavelet algorithm. This implementation of wavelet smoothing was optimized for use in a data stream. It was adapted from HMMSeg Wavelet.Java by Thomas E. Wilson, University of Michigan. HMMSeg Wavelet.Java was written by Andrew Hemmaplardh, University of Washington. -
21
abitools
Abinit calculations handling library
This package is a collection of modules to: o generate complete sets of files for Abinit calculation o run calculations o clean up data files o parse output files -
22
VigiWeb is a digital text maiden as a web site to present a collection of topics about Surveillance in Public Health
-
23
SRM2 Sound Recognizer Mobile 2
A Sound Recognition Framework developed to J2ME plataform
The SRM Framework 2 was developed for the J2ME platform supporting sound recognition dependent and speaker-independent, through the recognition techniques DTW (Dynamic Time Warping) and HMM (Hidden Markov Models), in addition to providing support to the import and export of data any stage of recognition enabling the use of external resources as well as the tool running steps on remote terminals. It has the following characteristics: - DTW - HMM (Discrete Models) - Suports Sound in PCM - Vector quantization using the k-means algorithm - Uses the algorithm Forward - Uses the algorithm Backward - Uses the Viterbi algorithm - Uses the Baum-Welch algorithm for training - Has features import and export data Further information is on Gaita 2012. -
24
pd-codelab
Collections of abstractions for Pure Data
pd-codelab is a collection of abstractions, patchs and scripts for the Pure Data software made by the French community, notably around the forum http://codelab.fr -
25
General Parametrization Framework
A Framework to Algorithms Execution with Different Parameters Configur
...However, the performance of these algorithms is often related to a good configuration of its parameters according to its using context. Aiming to support the identification of the best configuration, this work describes a framework used to optimize the algorithm results obtained with distinct configurations. For that, data of each algorithm configuration tested is collected and stored adequately to be used by statistical tools. Preliminary results indicate the relevance of this framework for the performance optimization of search algorithms.