Search Results for "random"

...TDS can be trained using Deep Reinforcement Learning, or using Gradient based optimization (for example LFBGS). In addition, the simulator can be entirely run on CUDA for fast rollouts, in combination with Augmented Random Search. This allows for 1 million simulation steps per second. It is highly recommended to use PyBullet Python bindings for improved support for robotics, reinforcement learning and VR. Use pip install pybullet and checkout the PyBullet Quickstart Guide.

...Compilation and minimal runtimes commonly unlock ML workloads on existing hardware. Automatically generate and optimize tensor operators on more backends. Need support for block sparsity, quantization (1,2,4,8 bit integers, posit), random forests/classical ML, memory planning, MISRA-C compatibility, Python prototyping or all of the above? NNVM flexible design enables all of these things and more.

...The peculiarity of this system is that the digital network created using radionic* technology that provides interaction between human and computer thinking. This digital network of the brain obtained by the interaction of the operator with the software, on the basis of generating random sequences at pomotsi quark-neuronal cluster. Thus, in part, this artificial neural network is a replica of the brain.

... - OpenMP versions of algorithms in [1] are available to download. - Main suite containing three community detection algorithms based on the Modularity measure containing: Geodesic and Random Walk edge Betweenness [1] and Spectral Modularity [2]. Collaborator: Theologos Kotsos. [1] M. Newman & M. Girvan, Physical Review, E 69 (026113), 2004. [2] M. Newman, Physical Review E, 74(3):036104, 2006. [3] B. Ball et al, An efficient and principled method for detecting communities in networks, 2011. The suite is based upon the fast community algorithm implemented by Aaron Clauset <aaron@cs.unm.edu>, Chris Moore, Mark Newman, and the R IGraph library Copyright (C) 2007 Gabor Csardi <csardi@rmki.kfki.hu>. ...

...The genetic algorithm engine supports various mutation rates, ranked parental selection, stochastic sampling parental selection, cyclic crossover, crossover at each gene, cloning the best individual each generation, and creating random individuals each generation. To use the genetic algorithm engine to search for a different problem's solution, one needs to program a fitness function, the project settings, and a few virtual functions.

Open source animation of kmeans clustering in X Window System using the C++ libplotter library. Supports Linux, Mac, and BSD. Includes common initialization methods such as Forgy, Macqueen, random, and angular. Sample videos are available through the Files Tab above. The SVN repo is accessible thorugh the Code Tab above. Requires a C++ compiler, libplot-dev, and libncurses5-dev Mac alternative to libplot-dev: macports plotutils +x11

Stable Graphical Model Learning (StabLe) is an algorithm for learning the structure and parameters of stable graphical (SG) models from data. Stable random variables are motivated by the central limit theorem for densities with (potentially) unbounded variance and can be thought of as natural generalizations of the Gaussian distribution to skewed and heavy-tailed phenomenon. SG models are multi-variate stable distributions that represent Bayesian networks whose edges encode linear dependencies amongst random variables. ...

This software package provides a framework for calculating similarity between neighborhoods rooted at two vertices of interest in a labeled graph (undirected or directed). The list of available similarity functions includes: cumulative random walk, standard random walk, standard graphlet kernel, edit distance graphlet kernel, label substitution graphlet kernel and edge indel graphlet kernel. The graphlet kernel framework can be used for vertex (node) classification in graphs, kernel-based clustering, or community detection. If you use this framework, please cite the following paper: Lugo-Martinez J, Radivojac P. ...

CrfAny is a C++ package for efficient and exact training and inference of Conditional Random Fields over any graphical structure, supporting all feature types (boolean, integer and real) and command line, C++/Python Lib interfaces.

With miao3d you can train a specific Gaussian Markov Random Field (GMRF) that then can be used to estimate a depthmap ("3D"), given an image ("2D"). A GUI allows inspection of the image + depthmap.