Sciweavers

    1451 search results - page 277 / 291
    » Order independence and rationalizability
    Sort
    View
    NIPS
    2007
    156views Information Technology» more  NIPS 2007»
    An Analysis of Convex Relaxations for MAP Estimation
    13 years 8 months ago
    An Analysis of Convex Relaxations for MAP Estimation
    Download  books.nips.cc
    The problem of obtaining the maximum a posteriori estimate of a general discrete random field (i.e. a random field defined using a finite and discrete set of labels) is known ...
    Pawan Mudigonda, Vladimir Kolmogorov, Philip H. S....
    claim paper
    Read More »
    AAAI
    2004
    167views Intelligent Agents» more  AAAI 2004»
    SCoT: A Spoken Conversational Tutor
    13 years 8 months ago
    SCoT: A Spoken Conversational Tutor
    Download  www.aaai.org
    We describe SCoT, a Spoken Conversational Tutor, which has been implemented in order to investigate the advantages of natural language in tutoring, especially spoken language. SCo...
    Karl Schultz, Brady Clark, Heather Pon-Barry, Eliz...
    claim paper
    Read More »
    AAAI
    2006
    213views Intelligent Agents» more  AAAI 2006»
    A Multi Agent Approach to Vision Based Robot Scavenging
    13 years 8 months ago
    A Multi Agent Approach to Vision Based Robot Scavenging
    Download  www.aaai.org
    This paper proposes a design for our entry into the 2006 AAAI Scavenger Hunt Competition and Robot Exhibition. We will be entering a scalable two agent system consisting of off-th...
    Kamil Wnuk, Brian Fulkerson, Jeremi Sudol
    claim paper
    Read More »
    FOIS
    2006
    124views Information Technology» more  FOIS 2006»
    Formalizing Ontology Alignment and its Operations with Category Theory
    13 years 8 months ago
    Formalizing Ontology Alignment and its Operations with Category Theory
    Download  www.dit.unitn.it
    An ontology alignment is the expression of relations between different ontologies. In order to view alignments independently from the language expressing ontologies and from the te...
    Antoine Zimmermann, Markus Krötzsch, Jé...
    claim paper
    Read More »
    IPCO
    2001
    184views Optimization» more  IPCO 2001»
    Approximation Algorithms for the Minimum Bends Traveling Salesman Problem
    13 years 8 months ago
    Approximation Algorithms for the Minimum Bends Traveling Salesman Problem
    Download  www.cs.dartmouth.edu
    Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...
    Clifford Stein, David P. Wagner
    claim paper
    Read More »
    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.