Sciweavers

    7904 search results - page 159 / 1581
    » Sequence Query Processing
    Sort
    View
    IPPS
    2005
    IEEE
    115views Distributed And Parallel Com...» more  IPPS 2005»
    Comparison of Current BLAST Software on Nucleotide Sequences
    14 years 2 months ago
    Comparison of Current BLAST Software on Nucleotide Sequences
    Download  www.hicomb.org
    The computational power needed for searching exponentially growing databases, such as GenBank, has increased dramatically. Three different implementations of the most widely used ...
    I. Elizabeth Cha, Eric C. Rouchka
    claim paper
    Read More »
    EMNLP
    2011
    177views Natural Language Processing» more  EMNLP 2011»
    Linking Entities to a Knowledge Base with Query Expansion
    12 years 8 months ago
    Linking Entities to a Knowledge Base with Query Expansion
    Download  aclweb.org
    Swapna Gottipati, Jing Jiang
    claim paper
    Read More »
    EMNLP
    2011
    165views Natural Language Processing» more  EMNLP 2011»
    Closing the Loop: Fast, Interactive Semi-Supervised Annotation With Queries on Features and Instances
    12 years 8 months ago
    Closing the Loop: Fast, Interactive Semi-Supervised Annotation With Queries on Features and Instances
    Download  aclweb.org
    Burr Settles
    claim paper
    Read More »
    ENTCS
    2006
    174views more  ENTCS 2006»
    Context Sequence Matching for XML
    13 years 9 months ago
    Context Sequence Matching for XML
    Download  www.risc.jku.at
    Context and sequence variables allow matching to explore term-trees both in depth and in breadth. It makes context sequence matching a suitable computational mechanism for a rule-...
    Temur Kutsia
    claim paper
    Read More »
    MFCS
    2000
    Springer
    105views Theoretical Computer Science» more  MFCS 2000»
    On the Autoreducibility of Random Sequences
    14 years 20 days ago
    On the Autoreducibility of Random Sequences
    Download  www.math.uni-heidelberg.de
    Abstract. A binary sequence A = A(0)A(1) . . . is called infinitely often (i.o.) Turing-autoreducible if A is reducible to itself via an oracle Turing machine that never queries it...
    Todd Ebert, Heribert Vollmer
    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.