Search Results for "space" - Page 2

...In contrast, Tangent performs ahead-of-time autodiff on the Python source code itself, and produces Python source code as its output. Tangent fills a unique location in the space of machine learning tools. As a result, you can finally read your automatic derivative code just like the rest of your program. Tangent is useful to researchers and students who not only want to write their models in Python, but also read and debug automatically-generated derivative code without sacrificing speed and flexibility. ...

...The essential problem is to find the correspondence between the audio and visual streams, which is the goal of this work. We proposed the utilization of a coupled 3D Convolutional Neural Network (CNN) architecture that can map both modalities into a representation space to evaluate the correspondence of audio-visual streams using the learned multimodal features.

...The project implements the system described in the research paper Neural Photo Editing with Introspective Adversarial Networks, which introduces a generative model capable of modifying images in semantically meaningful ways. Instead of editing images by directly manipulating pixels, the software allows users to influence changes in the latent space of a trained generative model. This approach enables large and coherent modifications to images while preserving visual realism. The system relies on an Introspective Adversarial Network, a hybrid architecture combining elements of variational autoencoders and generative adversarial networks to improve reconstruction accuracy and generative quality.

...To facilitate balanced workload distribution, we have proposed a general framework for symmetric all-pairs computation by building provable bijective functions between job identifier and coordinate space for the first time.

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. DEMassBayes.7z has jar file to be used with WEKA and a readme file listing parameters used. ...

The Star Ships Learning Framework (SSLF) provides basic routines and methods in order to interact with the space shooter Star Ships V2.1. It provides the necessary interfaces for controlling the program's ships and its logic from outside the game.

...It is a sequential covering algorithm, which was invented to cope with numeric data without discretization. Actually the nominal and numeric attributes are treated in the same way: attribute's space is being searched to find the best rule condition during rule induction. In result numeric attribute's conditions are more precise and closely describe the class. This algorithm contains some aspects of Rough Set Theory: the class definition can be described accordingly to its lower or upper approximation. For more information, see: Stefanowski, Jerzy. ...

Locally Weighted Projection Regression (LWPR) is a fully incremental, online algorithm for non-linear function approximation in high dimensional spaces, capable of handling redundant and irrelevant input dimensions. At its core, it uses locally linear models, spanned by a small number of univariate regressions in selected directions in input space. A locally weighted variant of Partial Least Squares (PLS) is employed for doing the dimensionality reduction. Please cite: [1] Sethu Vijayakumar, Aaron D'Souza and Stefan Schaal, Incremental Online Learning in High Dimensions, Neural Computation, vol. 17, no. 12, pp. 2602-2634 (2005). [2] Stefan Klanke, Sethu Vijayakumar and Stefan Schaal, A Library for Locally Weighted Projection Regression, Journal of Machine Learning Research (JMLR), vol. 9, pp. 623--626 (2008). ...

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 Vision and Pattern Recognition, 2012. ...

...Much of the search space is pruned early on by a user-selectable fitness function. Within a few epochs, reactor output quickly converges to several sub-optimal, yet high-output reactors. Given enough time, the idea is that the optimal reactor configuration will be yielded.

SMILE = Speech & Music Interpretation by Large Space Extraction openSMILE is a fast, real-time (audio) feature extraction utility for automatic speech, music and paralinguistic recognition research developed originally at TUM in the scope of the EU-project SEMAINE, now maintained and supported by audEERING.