Sciweavers

    1972 search results - page 108 / 395
    » connection 2008
    Sort
    View
    70
    Voted
    COLING
    2008
    137views Computational Linguistics» more  COLING 2008»
    A Complete and Modestly Funny System for Generating and Performing Japanese Stand-Up Comedy
    15 years 2 months ago
    A Complete and Modestly Funny System for Generating and Performing Japanese Stand-Up Comedy
    Download  www.aclweb.org
    We present a complete system that generates Japanese stand-up comedy. Different modules generating different types of jokes are tied together into a performance where all jokes ar...
    Jonas Sjöbergh, Kenji Araki
    claim paper
    Read More »
    102
    Voted
    ESANN
    2008
    111views Neural Networks» more  ESANN 2008»
    Self-Organizing Maps for cyclic and unbounded graphs
    15 years 2 months ago
    Self-Organizing Maps for cyclic and unbounded graphs
    Download  www.dice.ucl.ac.be
    Abstract. This paper introduces a new concept to the processing of graph structured information using self organising map framework. Previous approaches to this problem were limite...
    Markus Hagenbuchner, Alessandro Sperduti, Ah Chung...
    claim paper
    Read More »
    74
    Voted
    ICWSM
    2008
    104views Internet Technology» more  ICWSM 2008»
    Examining Privacy in Blogging from the Reader's Perspective
    15 years 2 months ago
    Examining Privacy in Blogging from the Reader's Perspective
    Download  www.ics.uci.edu
    While previous work has studied bloggers' practices with respect to negotiating privacy, little research has been done on blog readers' perceptions of privacy. This post...
    Eric Baumer, Mark Sueyoshi, Bill Tomlinson
    claim paper
    Read More »
    97
    Voted
    NIPS
    2008
    184views Information Technology» more  NIPS 2008»
    The Mondrian Process
    15 years 2 months ago
    The Mondrian Process
    Download  web.mit.edu
    We describe a novel class of distributions, called Mondrian processes, which can be interpreted as probability distributions over kd-tree data structures. Mondrian processes are m...
    Daniel M. Roy, Yee Whye Teh
    claim paper
    Read More »
    97
    Voted
    UAI
    2008
    200views Artificial Intelligence» more  UAI 2008»
    Bounding Search Space Size via (Hyper)tree Decompositions
    15 years 2 months ago
    Bounding Search Space Size via (Hyper)tree Decompositions
    Download  uai2008.cs.helsinki.fi
    This paper develops a measure for bounding the performance of AND/OR search algorithms for solving a variety of queries over graphical models. We show how drawing a connection to ...
    Lars Otten, Rina Dechter
    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-2026, USA.