Search Results for "mpeg-4" - Page 4
Sort By:
Showing 408 open source projects for "mpeg-4"
View related business solutions-
Deploy Red Hat Ansible Automation Platform on Microsoft Azure for a strategic automation solution that allows you to orchestrate, govern and operationalize your Azure environment.
-
HubSpot is an AI-powered customer platform with all the software, integrations, and resources you need to connect your marketing, sales, and customer service. HubSpot's connected platform enables you to grow your business faster by focusing on what matters most: your customers.
-
1
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, ...
-
2
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... -
3
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!). Force amplitude analisys for single curve takes from 1 to 4... -
4
PyVision Computer Vision Toolkit
A Python computer vision library
PyVision is a object-oriented Computer Vision Toolkit for researchers that contains vision and machine learning algorithms and algorithm analysis and easily interfaces with scipy/numpy, PIL, opencv and other computer and machine learning libraries. -
Take away the pain and hassle associated with applicant recruitment, hiring, and onboarding with ApplicantStack. Designed for HR professionals and recruiters, ApplicantStack helps streamline the recruiting and onboarding processes to improve productivity and reduce costs. ApplicantStack provides a complete toolkit that includes tools for posting, launching, and advertising jobs, assessing and managing candidates, collaborating with teams, centralizing information for quick hiring and onboarding, and more.
-
5
ParaBWT - parallel BWT construction
a parallel and space-efficient Burrows-Wheeler transfrom constructor
-
6
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 been... -
7
The fstrcmp project provides a shared library for making fuzzy string comparisons, and also provides an fstrcmp command for use in shell scripts.
-
8
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. Draper, "Scalable Action Recognition with a Subspace Forest," IEEE Conference on Computer... -
9
Open Hacking GateWay Client Crypto
Open Source HGWC's Encryption
This anti-cheating software is used by S4 League client to interface and check in real time XTRAP's features and to report the logs to their remote servers. Details: HGWC Version: 57 Protocol Version: 7 -
Manage your enterprise’s compensation lifecycle and accurately recognize top performers with a digitized, integrated system. Keep employees invested and your HR team in control while preventing compensation chaos.
-
10
Daniel Mirrai Framework for Delphi
Framework for developer Delphi
danielmirrai@gmail.com Framework complete for developer quick and easy using the programming model by layers Model view presenter (MVP) having superclasses already being ready all actions database, persistence, validations, instance classes and layouts. -
11
ktree
clustering, machine learning, algorithms
This project has moved to github at http://lmwtree.devries.ninja. -
12
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. -
13
Algo Trader (moved to AlgoSpace)
Algorithmic trading platform
This project is no longer supported. We are working on a new algorithmic trading platform with extreme fast execution speed and lots of cool features. Please visit http://www.algospace.com/ for more detail. -
14
drvq
dimensionality-recursive vector quantization
drvq is a C++ library implementation of dimensionality-recursive vector quantization, a fast vector quantization method in high-dimensional Euclidean spaces under arbitrary data distributions. It is an approximation of k-means that is practically constant in data size and applies to arbitrarily high dimensions but can only scale to a few thousands of centroids. As a by-product of training, a tree structure performs either exact or approximate quantization on trained centroids, the latter... -
15
IHC Profiler
A plugin for the quantitative analysis of Immunohistochemistry samples
Identification and scoring of cancer markers by Immunohistochemistry has been shown to be of value in determining the aggressiveness of specific cancers, as well as in predicting patient outcome for many cancer types. Despite its routine clinical use, a problem with the standard scoring method is the inherent subjectivity and variability of purely visual inspection. To diminish this visual perception biasing, IHC profiler has been developed as a standard automated scoring... -
16
matrix.h
Some basic matrix algorithms implemented in C
This is a collection of some matrix algorithms like matrix inverse, LU decomposition, Gauss elimination, matrix multiplication, matrix pow, matrix add, matrix subtract etc. This package also contains debugging information for the above algorithms -
17
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... -
18
Critterding
Evolving Artificial Life
Critterding is a "Petri dish" universe in 3D that demonstrates evolving artificial life. Critters start out with completely random brains and bodies, but will automatically start evolving into something with much better survival skills. -
19
PPSeq: Parallel NGS Analysis
Parallel Processing for Next-Generation Sequencing (NGS) Analysis
High-throughput next generation sequencing (NGS) technology has quickly emerged as a powerful tool in many aspects of biomedical research. However, along with its rapid development, the data magnitude and analysis complexity for NGS far exceed the capacity and capability of traditional small-scale computing facilities, such as multithreading algorithms on standalone workstations. To address this issue, here we present a solution using the ever-increasing supply of processing power by massive... -
20
DDMTestbed
An independent Data Distribution Management testbed
DDMTestbed is a testbed that allows you to generate random instances and evaluate your proposed resolutive method measuring execution time, memory occupied and distance from the optimal solution. It has been written in C language. -
21
gridrpcdm
Library implementing the GridRPC and GridRPC DM OGF stantards.
This library is a common implementation of both the Open Grid Forum GridRPC API _and_ GridRPC API Data Management standards. It is completely modular and already supports middleware modules for DIET and Ninf, as well as data manager modules for iRods, OwnCloud, rsync, scp. The installation is made easy with cmake and testing examples can be launched in a one line command. -
22
Programming Accessory Kit
PAK is a collection of library code to handle the overhead of coding
PAK is a collection of library code to handle the overhead of coding things like read-write locks, reflective multithreaded programming and simple file io. This is a java library collection, please see my API below... -
23
-
24
Shobhit-Improved String Search
SHOBHIT-Improved String Search is new improved string search algorithm
In Computer Science, SHOBHIT-Improved String Search Algorithm is a string searching algorithm created by SHOBHIT UPADHYAYA in August, 2013. He is working as a Software Developer in Bangalore India. “This algorithm uses the first, last, mid1 and mid2 index of the substring for a pattern search.” TIME and SPACE Complexity: For a text of length n and substring of length m. Its best case, time complexity is O(m/4) and in worst case, time complexity is O(n – (m/4) ). In all the cases... -
25