Sciweavers

    32545 search results - page 605 / 6509
    » Data Structures and Algorithms
    Sort
    View
    EMNLP
    2008
    199views Natural Language Processing» more  EMNLP 2008»
    Acquiring Domain-Specific Dialog Information from Task-Oriented Human-Human Interaction through an Unsupervised Learning
    15 years 9 months ago
    Acquiring Domain-Specific Dialog Information from Task-Oriented Human-Human Interaction through an Unsupervised Learning
    Download  www.aclweb.org
    We describe an approach for acquiring the domain-specific dialog knowledge required to configure a task-oriented dialog system that uses human-human interaction data. The key aspe...
    Ananlada Chotimongkol, Alexander I. Rudnicky
    claim paper
    Read More »
    CSL
    2002
    Springer
    187views Automated Reasoning» more  CSL 2002»
    Learning visually grounded words and syntax for a scene description task
    15 years 7 months ago
    Learning visually grounded words and syntax for a scene description task
    Download  www.media.mit.edu
    A spoken language generation system has been developed that learns to describe objects in computer-generated visual scenes. The system is trained by a `show-and-tell' procedu...
    Deb K. Roy
    claim paper
    Read More »
    KDD
    2004
    ACM
    90views Data Mining» more  KDD 2004»
    The IOC algorithm: efficient many-class non-parametric classification for high-dimensional data
    16 years 7 months ago
    The IOC algorithm: efficient many-class non-parametric classification for high-dimensional data
    Download  www.cs.cmu.edu
    Ting Liu, Ke Yang, Andrew W. Moore
    claim paper
    Read More »
    BMVC
    2001
    137views Computer Vision» more  BMVC 2001»
    Robust Registration of 2D and 3D Point Sets
    15 years 9 months ago
    Robust Registration of 2D and 3D Point Sets
    Download  luthuli.cs.uiuc.edu
    This paper introduces a new method of registering point sets. The registration error is directly minimized using general-purpose non-linear optimization (the Levenberg–Marquardt...
    Andrew W. Fitzgibbon
    claim paper
    Read More »
    ADMA
    2005
    Springer
    189views Data Mining» more  ADMA 2005»
    Parallel Genetic Algorithm and Parallel Simulated Annealing Algorithm for the Closest String Problem
    16 years 1 months ago
    Parallel Genetic Algorithm and Parallel Simulated Annealing Algorithm for the Closest String Problem
    Download  www.lboro.ac.uk
    In this paper, we design genetic algorithm and simulated annealing algorithm and their parallel versions to solve the Closest String problem. Our implementation and experiments sho...
    Xuan Liu, Hongmei He, Ondrej Sýkora
    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.