Sciweavers

    NIPS
    1998
    147views Information Technology» more  NIPS 1998»
    Convergence of the Wake-Sleep Algorithm
    13 years 11 months ago
    Convergence of the Wake-Sleep Algorithm
    Download  www.ism.ac.jp
    The W-S (Wake-Sleep) algorithm is a simple learning rule for the models with hidden variables. It is shown that this algorithm can be applied to a factor analysis model which is a...
    Shiro Ikeda, Shun-ichi Amari, Hiroyuki Nakahara
    claim paper
    Read More »
    BMVC
    1997
    127views Computer Vision» more  BMVC 1997»
    Robust Recursive Structure and Motion Recovery under Affine Projection
    13 years 11 months ago
    Robust Recursive Structure and Motion Recovery under Affine Projection
    Download  www.ee.usyd.edu.au
    In this paper we present an algorithm for structure and motion (SM) recovery under affine projection from video sequences. The algorithm tracks the motion of a single structure, b...
    Miroslav Trajkovic, Mark Hedley
    claim paper
    Read More »
    IRMA
    2000
    112views Information Technology» more  IRMA 2000»
    Recognizing bounds of context change in on-line learning
    13 years 11 months ago
    Recognizing bounds of context change in on-line learning
    Download  www.cs.jyu.fi
    The on-line algorithms in machine learning are intended to discover unknown function of the domain based on incremental observing of it instance by instance. These algorithms have...
    Helen Kaikova, Vagan Y. Terziyan, Borys Omelayenko
    claim paper
    Read More »
    IWMMDBMS
    1998
    117views more  IWMMDBMS 1998»
    Motion-based Parsing of Compressed Video
    13 years 11 months ago
    Motion-based Parsing of Compressed Video
    Download  www.cs.uga.edu
    An algorithm for detecting scene changes in compressed video streams is proposed. The proposed algorithm directly exploits the motion compensation information and the prediction e...
    Suchendra M. Bhandarkar, Aparna A. Khombhadia
    claim paper
    Read More »
    ACL
    1997
    76views Computational Linguistics» more  ACL 1997»
    A Portable Algorithm for Mapping Bitext Correspondence
    13 years 11 months ago
    A Portable Algorithm for Mapping Bitext Correspondence
    Download  www.aclweb.org
    The first step in most empirical work in multilingual NLP is to construct maps of the correspondence between texts and their translations (bitext maps). The Smooth Injective Map R...
    I. Dan Melamed
    claim paper
    Read More »
    IPCO
    1998
    87views Optimization» more  IPCO 1998»
    Simple Generalized Maximum Flow Algorithms
    13 years 11 months ago
    Simple Generalized Maximum Flow Algorithms
    Download  www.cs.princeton.edu
    We introduce a gain-scaling technique for the generalized maximum ow problem. Using this technique, we present three simple and intuitive polynomial-time combinatorialalgorithms fo...
    Éva Tardos, Kevin D. Wayne
    claim paper
    Read More »
    ICMAS
    2000
    117views Intelligent Agents» more  ICMAS 2000»
    Using Similarity Criteria to Make Negotiation Trade-Offs
    13 years 11 months ago
    Using Similarity Criteria to Make Negotiation Trade-Offs
    Download  eprints.ecs.soton.ac.uk
    This paper addresses the issues involved in software agents making trade-offs during automated negotiations in which they have information uncertainty and resource limitations. In...
    Peyman Faratin, Carles Sierra, Nicholas R. Jenning...
    claim paper
    Read More »
    AAAI
    1997
    134views Intelligent Agents» more  AAAI 1997»
    Worst-Case Absolute Loss Bounds for Linear Learning Algorithms
    13 years 11 months ago
    Worst-Case Absolute Loss Bounds for Linear Learning Algorithms
    Download  reference.kfupm.edu.sa
    The absolute loss is the absolute difference between the desired and predicted outcome. I demonstrateworst-case upper bounds on the absolute loss for the perceptron algorithm and ...
    Tom Bylander
    claim paper
    Read More »
    WSCG
    2003
    145views more  WSCG 2003»
    Real-Time Soft Shadows Using a Single Light Sample
    13 years 11 months ago
    Real-Time Soft Shadows Using a Single Light Sample
    Download  wscg.zcu.cz
    We present a real-time rendering algorithm that generates soft shadows of dynamic scenes using a single light sample. As a depth-map algorithm it can handle arbitrary shadowed sur...
    Florian Kirsch, Jürgen Döllner
    claim paper
    Read More »
    ESANN
    2000
    152views Neural Networks» more  ESANN 2000»
    An algorithm for the addition of time-delayed connections to recurrent neural networks
    13 years 11 months ago
    An algorithm for the addition of time-delayed connections to recurrent neural networks
    Download  www.dice.ucl.ac.be
    : Recurrent neural networks possess interesting universal approximation capabilities, making them good candidates for time series modeling. Unfortunately, long term dependencies ar...
    Romuald Boné, Michel Crucianu, Jean Pierre ...
    claim paper
    Read More »
    « first‹ previous…134135136137138139140141142…next ›last »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.