Search Results for "half-edge" - Page 3

Illustrations of Neural Network architectures are often time-consuming to produce, and machine learning researchers all too often find themselves constructing these diagrams from scratch by hand. NN-SVG is a tool for creating Neural Network (NN) architecture drawings parametrically rather than manually. It also provides the ability to export those drawings to Scalable Vector Graphics (SVG) files, suitable for inclusion in academic papers or web pages. The tool provides the ability to...

...In the system, a learning task is formulated as a directed acyclic graph (DAG) in which each node represents an operation (e.g. a machine learning algorithm), and each edge represents the flow of the data from one node to its descendants.

... - 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>. ...

This site contains four packages of Mass and mass-based density estimation. 1. The first package is about the basic mass estimation (including one-dimensional mass estimation and Half-Space Tree based multi-dimensional mass estimation). This packages contains the necessary codes to run on MATLAB. 2. The second package includes source and object files of DEMass-DBSCAN to be used with the WEKA system. 3. The third package DEMassBayes includes the source and object files of a Bayesian classifier using DEMass. ...

...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. Generalized graphlet kernels for probabilistic inference in sparse graphs. Network Science (2014) 2(2): 254-276.

Supertagging is a process of statistical lexical disambiguation, preprocessing step to parsing, which assigns LTAG tree categories to the lexical items present in the input sentence. Thus, if the input sentence is in the form of a dependency tree, the task of the supertagger is to assign the most probable TAG family to each node and edge in the dependency tree.

Savant is an open-source, high-level framework for building real-time, streaming, highly efficient multimedia AI applications on the Nvidia stack. It helps to develop dynamic, fault-tolerant inference pipelines that utilize the best Nvidia approaches for data center and edge accelerators. Savant is built on DeepStream and provides a high-level abstraction layer for building inference pipelines. It is designed to be easy to use, flexible, and scalable. It is a great choice for building smart CV and video analytics applications for cities, retail, manufacturing, and more.