Sciweavers

    1930 search results - page 103 / 386
    » Learning to Solve QBF
    Sort
    View
    116
    Voted
    FLAIRS
    2006
    137views Artificial Intelligence» more  FLAIRS 2006»
    One-Shot Procedure Learning from Instruction and Observation
    15 years 5 months ago
    One-Shot Procedure Learning from Instruction and Observation
    Download  cs.stanford.edu
    Learning tasks from a single demonstration presents a significant challenge because the observed sequence is inherently an incomplete representation of the procedure that is speci...
    Hyuckchul Jung, James F. Allen, Nathanael Chambers...
    claim paper
    Read More »
    147
    Voted
    GRC
    2008
    IEEE
    173views Applied Computing» more  GRC 2008»
    Neighborhood Smoothing Embedding for Noisy Manifold Learning
    15 years 4 months ago
    Neighborhood Smoothing Embedding for Noisy Manifold Learning
    Download  www.cse.wustl.edu
    Manifold learning can discover the structure of high dimensional data and provides understanding of multidimensional patterns by preserving the local geometric characteristics. Ho...
    Guisheng Chen, Junsong Yin, Deyi Li
    claim paper
    Read More »
    171
    Voted
    CVPR
    2008
    IEEE
    198views Computer Vision» more  CVPR 2008»
    Robust learning of discriminative projection for multicategory classification on the Stiefel manifold
    15 years 3 months ago
    Robust learning of discriminative projection for multicategory classification on the Stiefel manifold
    Download  mplab.ucsd.edu
    Learning a robust projection with a small number of training samples is still a challenging problem in face recognition, especially when the unseen faces have extreme variation in...
    Duc-Son Pham, Svetha Venkatesh
    claim paper
    Read More »
    JMLR
    2006
    112views more  JMLR 2006»
    Kernels on Prolog Proof Trees: Statistical Learning in the ILP Setting
    15 years 3 months ago
    Kernels on Prolog Proof Trees: Statistical Learning in the ILP Setting
    Download  jmlr.csail.mit.edu
    We develop kernels for measuring the similarity between relational instances using background knowledge expressed in first-order logic. The method allows us to bridge the gap betw...
    Andrea Passerini, Paolo Frasconi, Luc De Raedt
    claim paper
    Read More »
    124
    Voted
    CONNECTION
    2004
    98views more  CONNECTION 2004»
    Self-refreshing memory in artificial neural networks: learning temporal sequences without catastrophic forgetting
    15 years 3 months ago
    Self-refreshing memory in artificial neural networks: learning temporal sequences without catastrophic forgetting
    Download  web.upmf-grenoble.fr
    While humans forget gradually, highly distributed connectionist networks forget catastrophically: newly learned information often completely erases previously learned information. ...
    Bernard Ans, Stephane Rousset, Robert M. French, S...
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.