Sciweavers

    4008 search results - page 789 / 802
    » An expressive language of signatures
    Sort
    View
    DLOG
    2001
    125views Automated Reasoning» more  DLOG 2001»
    Using Lazy Unfolding for the Computation of Least Common Subsumers
    13 years 9 months ago
    Using Lazy Unfolding for the Computation of Least Common Subsumers
    Download  www.inf.unibz.it
    For description logics with existential restrictions, the size of the least common subsumer (lcs) of concept descriptions may grow exponentially in the size of the concept descrip...
    Anni-Yasmin Turhan, Ralf Molitor
    claim paper
    Read More »
    NDQA
    2003
    129views Education» more  NDQA 2003»
    Knowledge Tracking: Answering Implicit Questions
    13 years 9 months ago
    Knowledge Tracking: Answering Implicit Questions
    Download  www.cs.bham.ac.uk
    Research on Question Answering has produced an arsenal of useful techniques for detecting answers that are explicitly present in the text of a collection of documents. To move bey...
    Reinhard Stolle, Daniel G. Bobrow, Cleo Condoravdi...
    claim paper
    Read More »
    DAIS
    1997
    123views Distributed And Parallel Com...» more  DAIS 1997»
    A System for Specifying and Coordinating the Execution of Reliable Distributed Applications
    13 years 9 months ago
    A System for Specifying and Coordinating the Execution of Reliable Distributed Applications
    Download  www.cs.ncl.ac.uk
    An increasing number of distributed applications are being constructed by composing them out of existing applications. The resulting applications can be very complex in structure,...
    Frédéric Ranno, Santosh K. Shrivasta...
    claim paper
    Read More »
    COLING
    1996
    131views Computational Linguistics» more  COLING 1996»
    Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
    13 years 9 months ago
    Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
    Download  staff.science.uva.nl
    This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
    Khalil Sima'an
    claim paper
    Read More »
    ISMB
    1994
    138views Computational Biology» more  ISMB 1994»
    Predicting Location and Structure Of beta-Sheet Regions Using Stochastic Tree Grammars
    13 years 9 months ago
    Predicting Location and Structure Of beta-Sheet Regions Using Stochastic Tree Grammars
    Download  www.bic.kyoto-u.ac.jp
    We describe and demonstrate the effectiveness of a method of predicting protein secondary structures, sheet regions in particular, using a class of stochastic tree grammars as rep...
    Hiroshi Mamitsuka, Naoki Abe
    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.