Search Results for "sandbox:/mnt/data/project_plan.pod" - Page 5
Sort By:
Showing 269 open source projects for "sandbox:/mnt/data/project_plan.pod"
View related business solutions-
Ecwid is a hosted cloud commerce platform used by over 1.5 million merchants and offers the easiest way to add an online store to any website, social site or multiple sites simultaneously.Set up your Ecwid store once to easily sync and sell across a website, social media, marketplaces like Amazon, and live in-person. Get started with one, or try them all.
-
Feroot AI automates website security with 24/7 monitoringFeroot unifies JavaScript behavior analysis, web compliance scanning, third-party script monitoring, consent enforcement, and data privacy posture management to stop Magecart, formjacking, and unauthorized tracking.
-
1
The library for utilization of Minimal Quadtree format for storing very large sparse matrices. Please see the paper referenced below for the description of a problem. Corresponding papers: Tree-based Space Efficient Formats for Storing the Structure of Sparse Matrices (I. Šimeček, D. Langr, P. Tvrdík), In Scalable Computing: Practice and Experience, volume 15, 2014. Space Efficient Formats for Structure of Sparse Matrices Based on Tree Structures (I. Šimeček, Daniel Langr, Pavel...
-
2
Ginors Sort
sorting algorithm for binary keys
in-place sorting algorithm with O(n*log(k)) time komplexity. The data have to be the structure: struct { unsigned (char/short/int/long); [...] } -
3
deapheap
Deap is a doubly heap for both min and max number access.
A deap is a doubly priority queue for efficient data operations. Both insertion and deletion operations take O(log(N)) time. Access of min or max takes constant time. It can be useful when both min and max are needed in the queue. It can also be used in situations where the number of items is too large and items with low priorities can be dropped with keep memory footprint small. -
4
S-Match
S-Match is a semantic matching framework.
S-Match is a semantic matching framework. S-Match takes any two tree like structures (such as database schemas, classifications, lightweight ontologies) and returns a set of correspondences between those tree nodes which semantically correspond to one another. S-Match contains implementations of the semantic matching, minimal semantic matching and structure preserving semantic matching algorithms. S-Match applies as a solution in many fields, including: information integration,... -
We help you deliver Virtual and Hybrid Events using our Award Winning end-to-end Event Management PlatformEventsAIR have been anticipating and responding to the ever-changing event industry needs for over 30 years, providing innovative solutions that empower event organizers to create successful events around the globe.
-
5
libdry
Public domain implementations of useful data structures for C++14.
libdry is a C++44 shared library containing public domain implementations of data structures and algorithms. -
6
-
7
Online Signature Verification
Real time signature verification using MATLAB and C#
...An individual can sign on the digitizing tablet using the special pen regardless of his signature size and position. The signature is characterized as pen-strokes consisting x-y coordinates and pressure with the data being stored in a signature database. Dynamic time warping (DTW) and quadratic discriminant analysis (QDA) is used to get results where the system accepts 2% of forged signatures and rejects 5% of true signatures -
8
BudgetedSVM
BudgetedSVM: A C++ Toolbox for Large-scale, Non-linear Classification
...BudgetedSVM trains models with accuracy comparable to LibSVM in time comparable to LibLinear, as it allows solving highly non-linear classi fication problems with millions of high-dimensional examples within minutes on a regular personal computer. We provide command-line and Matlab interfaces to BudgetedSVM, efficient API for handling large-scale, high-dimensional data sets, as well as detailed documentation to help developers use and further extend the toolbox. -
9
PdfPageCounter
C++ code to count the number pages in a given PDF file.
...While the PdfPageCount class is very simple to use, the contained code is complex because the page count can be hidden in any number of places, quite often within compressed data. -
Create engaging surveys on your tablet or computer with ease.Create great-looking surveys, forms, polls, voting, questionnaires, NPS, customer satisfaction, customer experience, employee satisfaction surveys... on your computer or tablet, customize the look of your survey however you like, & display collected data with eye-catching and insightful graphics.
-
10
MRA
A general recommender system with basic models and MRA
Multi-categorization Recommendation Adjusting (MRA) is to optimize the results of recommendation based on traditional(basic) recommendation models, through introducing objective category information and taking use of the feature that users always get the habits of preferring certain categories. Besides this, there are two advantages of this improved model: 1) it can be easily applied to any kind of existing recommendation models. And 2) a controller is set in this improved model to provide... -
11
FastPeak
Fast AFM force curve peaks detector algorithm
This is showcase program, with source code and sample data included for fast peak detection algorithm. It is great tool for entry level, automated analisys, to discard empty and junk curves and save only ones matching required criteria. Assuming that only 1% of data is worth reviewing, and that manual selection takes approx. 3 seconds per curve, you can save up to 8 hours per every 10000 curves (like 2 days every week!). -
12
Java Machine Learning Library is a library of machine learning algorithms and related datasets. Machine learning techniques include: clustering, classification, feature selection, regression, data pre-processing, ensemble learning, voting, ...
-
13
VandaMiaMightyCollection
Data container similar to Visual Basic Collection as a COM component
This is an COM/ATL implementation of data container similar to Visual Basic Collection that can perform any operation in logarithm time. -
14
ontocomp
OntoComP is a Protégé 4 plug-in for completing OWL ontologies
OntoComP is a Protégé 4 plug-in for completing OWL ontologies. It enables the user to check whether an OWL ontology contains "all relevant information" about the application domain, and extends the ontology appropriately if this is not the case. It achieves this by asking the user questions of the form "are instances of classes C1 and C2 also instances of class C3?". If the user confirms such a question, then a new axiom of the application domain that does not follow from the ontology has... -
15
Graphal
Graph algorithms interpreter, IDE, debugger, 3D visualizations.
Graphal is an interpreter of a programming language that is mainly oriented to graph algorithms. There is a command line interpreter and a graphical integrated development environment. The IDE contains text editor for programmers, compilation and script output, advanced debugger and visualization window. The progress of the interpreted and debugged graph algorithm can be displayed in 3D scene. -
16
ProximityForest
Efficient Approximate Nearest Neighbors for General Metric Spaces
A proximity forest is a data structure that allows for efficient computation of approximate nearest neighbors of arbitrary data elements in a metric space. See: O'Hara and Draper, "Are You Using the Right Approximate Nearest Neighbor Algorithm?", WACV 2013 (best student paper award). One application of a ProximityForest is given in the following CVPR publication: Stephen O'Hara and Bruce A. -
17
...Sendo eles programas simples que foram desenvolvidos para a aquisição de nota no curso de BCC. Os programas em si, estão ainda em desenvolvimento sendo disponibilizado uma prévia dos progressivos resultados, não se tendo uma data de finalização do projeto definida. Fica a disposição os códigos deles sobre a licença GPL para que estudantes e interessados possam fazer uso e estudo dos mesmos.
-
18
drvq
dimensionality-recursive vector quantization
...A detailed README file describes the usage of the software, including license, requirements, installation, file formats, sample data, tools, and options. With the sample data provided and the default options, it is possible to test the code immediately as a demo. DRVQ has a 2-clause BSD license. Please refer to the DRVQ software home page, the research project, or the original publication for more information. The latest code is available at github. -
19
Rating Algorithms
Library implementating various rating, scoring, ranking algorithms.
The rating algorithms library contains various algorithms used to accurately rank, score or rate collections of similar data. One example is the ranking of votes based on a 5 star scale. This project started as a need of ordering data based on the relevance of each record obtained from users. The first algorithm implemented is based on Wilson Score Interval. -
20
This library implements a thread-safe skip list data structure - a kind of list with good insertion, deletion and searching performances. It uses Fred Fish's dbug library as internal tracing/debugging system. See the web site for more details.
-
21
Funnel Sort
command line sort utility
...Funnel is a sort utility to sort files, large and small. It efficiently handles fixed length records and variable length records. Funnel easily handles ascii (readable) data and binary data. There are many more features in Funnel. It is easy to use and very fast. All documentation is on the Wiki. -
22
AlgART Java Libraries
Open source library for processing arrays and matrices
...So, anyone can use them for free without any restrictions. Main features: 63-bit addressing of array elements (64-bit long int indexes), memory model concept (allowing storing data in different schemes from RAM to mapped disk files), wide usage of lazy evaluations, built-in multithreading optimization for multi-core processors, wide set of image processing algorithms over matrices, etc. - please see at the site. Almost all classes and methods are thoroughly documented via JavaDoc (you may read full JavaDoc at the site). -
23
All About Data Structures
Sorting Searching List Template All
This will help a new data structure learner to learn data structures quickly. -
24
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... -
25
Generic optimization of on demand calculation. Generation of C# code for data model and computation code Definition of the xF language IDE: edition of xF project. Excel 2010 Addin available
