Sciweavers

    861 search results - page 9 / 173
    » Faster integer multiplication
    Sort
    View
    DCC
    2005
    IEEE
    81views Computer Graphics» more  DCC 2005»
    Quantization of Multiple Sources Using Integer Bit Allocation
    14 years 7 months ago
    Quantization of Multiple Sources Using Integer Bit Allocation
    Download  www.code.ucsd.edu
    Asymptotically optimal bit allocation among a set of quantizers for a finite collection of sources was determined in 1963 by Huang and Schultheiss. Their solution, however, gives ...
    Benjamin Farber, Kenneth Zeger
    claim paper
    Read More »
    STACS
    2001
    Springer
    112views Theoretical Computer Science» more  STACS 2001»
    New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing
    14 years 4 days ago
    New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing
    Download  ls2-www.cs.uni-dortmund.de
    Abstract. Ordered binary decision diagrams (OBDDs) nowadays belong to the most common representation types for Boolean functions. Although they allow important operations such as s...
    Philipp Woelfel
    claim paper
    Read More »
    STOC
    2003
    ACM
    92views Algorithms» more  STOC 2003»
    Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions
    14 years 8 months ago
    Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions
    Download  pages.cpsc.ucalgary.ca
    Martin Sauerhoff, Philipp Woelfel
    claim paper
    Read More »
    ARITH
    2007
    IEEE
    87views Applied Computing» more  ARITH 2007»
    Montgomery Reduction Algorithm for Modular Multiplication Using Low-Weight Polynomial Form Integers
    14 years 2 months ago
    Montgomery Reduction Algorithm for Modular Multiplication Using Low-Weight Polynomial Form Integers
    Download  www.cacr.math.uwaterloo.ca
    Jaewook Chung, M. Anwar Hasan
    claim paper
    Read More »
    ARITH
    1995
    IEEE
    80views Applied Computing» more  ARITH 1995»
    Reducing the number of counters needed for integer multiplication
    13 years 11 months ago
    Reducing the number of counters needed for integer multiplication
    Download  www.acsel-lab.com
    Robert Michael Owens, Raminder Singh Bajwa, Mary J...
    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.