Sciweavers

    NIPS
    1992
    197views Information Technology» more  NIPS 1992»
    A Note on Learning Vector Quantization
    13 years 11 months ago
    A Note on Learning Vector Quantization
    Download  eref.uqu.edu.sa
    Vector Quantization is useful for data compression. Competitive Learning which minimizes reconstruction error is an appropriate algorithm for vector quantization of unlabelled dat...
    Virginia R. de Sa, Dana H. Ballard
    claim paper
    Read More »
    NIPS
    1992
    99views Information Technology» more  NIPS 1992»
    Feudal Reinforcement Learning
    13 years 11 months ago
    Feudal Reinforcement Learning
    Download  www.cs.ru.ac.za
    This paper describes the adaption and application of an algorithm called Feudal Reinforcement Learning to a complex gridworld navigation problem. The algorithm proved to be not ea...
    Peter Dayan, Geoffrey E. Hinton
    claim paper
    Read More »
    MVA
    1992
    127views Computer Vision» more  MVA 1992»
    A Parallel Topological Map for Image Segmentation
    13 years 11 months ago
    A Parallel Topological Map for Image Segmentation
    Download  b2.cvl.iis.u-tokyo.ac.jp
    We present a new algorithm for topological feature mapping. It is compared to other known feature mapping algorithmslike that proposed by Kohonen or Bertsch. The main difference t...
    Dinu Scheppelmann, Jochen Frey, Manuela Schäf...
    claim paper
    Read More »
    MVA
    1990
    100views Computer Vision» more  MVA 1990»
    A High Speed Word Matching Algorithm for Handwritten Chinese Character Recognition
    13 years 11 months ago
    A High Speed Word Matching Algorithm for Handwritten Chinese Character Recognition
    Download  b2.cvl.iis.u-tokyo.ac.jp
    A new high speed word matching algorithm for handwritten Chinese character recomition is presented. Acontinuous string without delimiting space is recognized in real time by using...
    Katsumi Marukawa, Masashi Koga, Yoshihiro Shima, H...
    claim paper
    Read More »
    ANLP
    1992
    116views more  ANLP 1992»
    Automatic Learning for Semantic Collocation
    13 years 11 months ago
    Automatic Learning for Semantic Collocation
    Download  cs.nyu.edu
    The real di culty in development of practical NLP systems comes from the fact that we do not have e ective means for gathering \knowledge". In this paper, we propose an algor...
    Satoshi Sekine, Jeremy J. Carroll, Sophia Ananiado...
    claim paper
    Read More »
    ACL
    1992
    107views Computational Linguistics» more  ACL 1992»
    An Algorithm for VP Ellipsis
    13 years 11 months ago
    An Algorithm for VP Ellipsis
    Download  www.aclweb.org
    An algorithm is proposed to determine antecedents for VP ellipsis. The algorithm eliminates impossible antecedents, and then imposes a preference ordering on possible antecedents....
    Daniel Hardt
    claim paper
    Read More »
    EACL
    1989
    ACL Anthology
    124views Natural Language Processing» more  EACL 1989»
    An Algorithm For Generation In Unification Categorial Grammar
    13 years 11 months ago
    An Algorithm For Generation In Unification Categorial Grammar
    Download  acl.ldc.upenn.edu
    We present an algorithm for the generation of sentences from the semantic representations of Unification Categorial Grammar. We discuss a variant of Shieber's semantic monoto...
    Jonathan Calder, Mike Reape, Henk Zeevat
    claim paper
    Read More »
    SODA
    1996
    ACM
    121views Algorithms» more  SODA 1996»
    Optimal Placement of Convex Polygons to Maximize Point Containment
    13 years 11 months ago
    Optimal Placement of Convex Polygons to Maximize Point Containment
    Download  community.middlebury.edu
    Given a convex polygon P with m vertices and a set S of n points in the plane, we consider the problem of nding a placement of P that contains the maximum number of points in S. W...
    Matthew Dickerson, Daniel Scharstein
    claim paper
    Read More »
    SODA
    1994
    ACM
    133views Algorithms» more  SODA 1994»
    Derandomizing Algorithms for Routing and Sorting on Meshes
    13 years 11 months ago
    Derandomizing Algorithms for Routing and Sorting on Meshes
    Download  cis.poly.edu
    We describe a new technique that can be used to derandomize a number of randomized algorithms for routing and sorting on meshes. We demonstrate the power of this technique by deri...
    Michael Kaufmann, Jop F. Sibeyn, Torsten Suel
    claim paper
    Read More »
    PSTV
    1993
    123views Hardware» more  PSTV 1993»
    On the Verification of Temporal Properties
    13 years 11 months ago
    On the Verification of Temporal Properties
    Download  spinroot.com
    We present a new algorithm that can be used for solving the model−checking problem for linear−time temporal logic. This algorithm can be viewed as the combination of two exist...
    Patrice Godefroid, Gerard J. Holzmann
    claim paper
    Read More »
    « first‹ previous…131132133134135136137138139…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.