Sciweavers

    7943 search results - page 97 / 1589
    » A calculus for costed computations
    Sort
    View
    FOCS
    2009
    IEEE
    163views Theoretical Computer Science» more  FOCS 2009»
    Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions
    16 years 1 months ago
    Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions
    Download  www.openu.ac.il
    Abstract— We give approximation algorithms for the Generalized Steiner Network (GSN) problem. The input consists of a graph
    Zeev Nutov
    claim paper
    Read More »
    HPCA
    1998
    IEEE
    90views Distributed And Parallel Com...» more  HPCA 1998»
    The Architectural Costs of Streaming I/O: A Comparison of Workstations, Clusters, and SMPs
    15 years 10 months ago
    The Architectural Costs of Streaming I/O: A Comparison of Workstations, Clusters, and SMPs
    Download  pages.cs.wisc.edu
    Remzi H. Arpaci-Dusseau, Andrea C. Arpaci-Dusseau,...
    claim paper
    Read More »
    DAC
    2002
    ACM
    92views Computer Architecture» more  DAC 2002»
    A detailed cost model for concurrent use with hardware/software co-design
    16 years 7 months ago
    A detailed cost model for concurrent use with hardware/software co-design
    Download  www.enme.umd.edu
    Daniel Ragan, Peter Sandborn, Paul Stoaks
    claim paper
    Read More »
    PKC
    1999
    Springer
    94views Cryptology» more  PKC 1999»
    Low-Cost Double-Size Modular Exponentiation or How to Stretch Your Cryptoprocessor
    15 years 10 months ago
    Low-Cost Double-Size Modular Exponentiation or How to Stretch Your Cryptoprocessor
    Download  www.gemplus.com
    Public-key implementers often face strong hardware-related constraints. In particular, modular operations required in most cryptosystems generally constitute a computational bottle...
    Pascal Paillier
    claim paper
    Read More »
    ACL
    2009
    119views Computational Linguistics» more  ACL 2009»
    Automatic Cost Estimation for Tree Edit Distance Using Particle Swarm Optimization
    15 years 4 months ago
    Automatic Cost Estimation for Tree Edit Distance Using Particle Swarm Optimization
    Download  www.aclweb.org
    Recently, there is a growing interest in working with tree-structured data in different applications and domains such as computational biology and natural language processing. Mor...
    Yashar Mehdad
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.