Sciweavers

    17049 search results - page 121 / 3410
    » cans 2007
    Sort
    View
    SERP
    2007
    79views Software Engineering» more  SERP 2007»
    Developing an Online Function Reader
    13 years 11 months ago
    Developing an Online Function Reader
    Download  www.uwstout.edu
    A function reader is a program that can read an input function and evaluate the function for a given input value at run time. Any Computer Algebra System and Graphing Calculator ar...
    Mingshen Wu, Weihu Hong
    claim paper
    Read More »
    ACL
    2006
    140views Computational Linguistics» more  ACL 2006»
    Discriminative Reranking for Semantic Parsing
    13 years 11 months ago
    Discriminative Reranking for Semantic Parsing
    Download  www.cs.utexas.edu
    Semantic parsing is the task of mapping natural language sentences to complete formal meaning representations. The performance of semantic parsing can be potentially improved by u...
    Ruifang Ge, Raymond J. Mooney
    claim paper
    Read More »
    BIOCOMP
    2006
    233views Bioinformatics» more  BIOCOMP 2006»
    Dynamic Bayesian Network (DBN) with Structure Expectation Maximization (SEM) for Modeling of Gene Network from Time Series Gene
    13 years 11 months ago
    Dynamic Bayesian Network (DBN) with Structure Expectation Maximization (SEM) for Modeling of Gene Network from Time Series Gene
    Download  ww1.ucmss.com
    Exploring gene regulatory network is a key topic in molecular biology. In this paper, we present a new dynamic Bayesian network (DBN) framework embedded with structural expectatio...
    Yu Zhang, Zhidong Deng, Hongshan Jiang, Peifa Jia
    claim paper
    Read More »
    DAGSTUHL
    2004
    108views Software Engineering» more  DAGSTUHL 2004»
    The communication complexity of the Exact-N Problem revisited
    13 years 11 months ago
    The communication complexity of the Exact-N Problem revisited
    Download  drops.dagstuhl.de
    If Alice has x, y, Bob has x, z and Carol has y, z can they determine if x + y + z = N? They can if (say) Alice broadcasts x to Bob and Carol; can they do better? Chandra, Furst, a...
    William I. Gasarch, James Glenn, Andrey Utis
    claim paper
    Read More »
    DAGSTUHL
    2004
    117views Software Engineering» more  DAGSTUHL 2004»
    Learning with Local Models
    13 years 11 months ago
    Learning with Local Models
    Download  www.stefan-rueping.de
    Next to prediction accuracy, the interpretability of models is one of the fundamental criteria for machine learning algorithms. While high accuracy learners have intensively been e...
    Stefan Rüping
    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.