Sciweavers

    6939 search results - page 102 / 1388
    » Algorithm Engineering for Parallel Computation
    Sort
    View
    CAP
    2010
    118views Distributed And Parallel Com...» more  CAP 2010»
    Parallel disk-based computation for large, monolithic binary decision diagrams
    13 years 3 months ago
    Parallel disk-based computation for large, monolithic binary decision diagrams
    Download  www.ccs.neu.edu
    Binary Decision Diagrams (BDDs) are widely used in formal verification. They are also widely known for consuming large amounts of memory. For larger problems, a BDD computation wi...
    Daniel Kunkle, Vlad Slavici, Gene Cooperman
    claim paper
    Read More »
    KDD
    2006
    ACM
    200views Data Mining» more  KDD 2006»
    A Random-Walk Based Scoring Algorithm Applied to Recommender Engines
    14 years 8 months ago
    A Random-Walk Based Scoring Algorithm Applied to Recommender Engines
    Download  nautilus.dii.unisi.it
    Recommender systems are an emerging technology that helps consumers find interesting products and useful resources. A recommender system makes personalized product suggestions by e...
    Augusto Pucci, Marco Gori, Marco Maggini
    claim paper
    Read More »
    JCB
    2000
    129views more  JCB 2000»
    Prediction of RNA Base Pairing Probabilities on Massively Parallel Computers
    13 years 8 months ago
    Prediction of RNA Base Pairing Probabilities on Massively Parallel Computers
    Download  www.tbi.univie.ac.at
    We present an implementation of McCaskill's algorithm for computing the base pair probabilities of an RNA molecule for massively parallel message passing architectures. The p...
    Martin Fekete, Ivo L. Hofacker, Peter F. Stadler
    claim paper
    Read More »
    ISSAC
    2007
    Springer
    99views Mathematics» more  ISSAC 2007»
    Computing monodromy via parallel homotopy continuation
    14 years 2 months ago
    Computing monodromy via parallel homotopy continuation
    Download  www.math.tamu.edu
    Numerical homotopy continuation gives a powerful tool for the applied scientist who seeks solutions to a system of polynomial equations. Techniques from numerical homotopy continu...
    Anton Leykin, Frank Sottile
    claim paper
    Read More »
    TC
    2008
    109views Information Technology» more  TC 2008»
    Low-Complexity Bit-Parallel Square Root Computation over GF(2^{m}) for All Trinomials
    13 years 8 months ago
    Low-Complexity Bit-Parallel Square Root Computation over GF(2^{m}) for All Trinomials
    Download  eprint.iacr.org
    In this contribution we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied for any type ...
    Francisco Rodríguez-Henríquez, Guill...
    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.