Sciweavers

    5372 search results - page 234 / 1075
    » complexity 2007
    Sort
    View
    ACSW
    2006
    146views Security Privacy» more  ACSW 2006»
    Formal analysis of secure contracting protocol for e-tendering
    13 years 9 months ago
    Formal analysis of secure contracting protocol for e-tendering
    Download  www.crpit.com
    Formal specification and verification of protocols have been credited for uncovering protocol flaws; revealing inadequacies in protocol design of the Initial Stage and Negotiation...
    Rong Du, Ernest Foo, Colin Boyd, Kim-Kwang Raymond...
    claim paper
    Read More »
    CDES
    2006
    98views Hardware» more  CDES 2006»
    Instruction Fetch Energy Reduction Using Forward-Branch Bufferable Innermost Loop Buffer
    13 years 9 months ago
    Instruction Fetch Energy Reduction Using Forward-Branch Bufferable Innermost Loop Buffer
    Download  ww1.ucmss.com
    Recently, several loop buffer designs have been proposed to reduce instruction fetch energy due to size and location advantage of loop buffer. Nevertheless, on design complexity di...
    Bin-Hua Tein, I-Wei Wu, Chung-Ping Chung
    claim paper
    Read More »
    ACL
    1998
    118views Computational Linguistics» more  ACL 1998»
    A Test Environment for Natural Language Understanding Systems
    13 years 9 months ago
    A Test Environment for Natural Language Understanding Systems
    Download  www.aclweb.org
    The Natural Language Understanding Engine Test Environment (ETE) is a GUI software tool that aids in the development and maintenance of large, modular, natural language understand...
    Li Li, Deborah A. Dahl, Lewis M. Norton, Marcia C....
    claim paper
    Read More »
    IJCAI
    1993
    91views Artificial Intelligence» more  IJCAI 1993»
    On the Polynomial Transparency of Resolution
    13 years 9 months ago
    On the Polynomial Transparency of Resolution
    Download  dli.iiit.ac.in
    In this paper a framework is developed for measuring the complexities of deductions in an ab­ stract and computationally perspicuous man­ ner. As a notion of central importance ...
    Reinhold Letz
    claim paper
    Read More »
    EJC
    2006
    91views Information Technology» more  EJC 2006»
    Counting connected graphs asymptotically
    13 years 8 months ago
    Counting connected graphs asymptotically
    Download  www.win.tue.nl
    We find the asymptotic number of connected graphs with k vertices and k - 1 + l edges when k, l approach infinity, reproving a result of Bender, Canfield and McKay. We use the pro...
    Remco van der Hofstad, Joel Spencer
    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.