Sciweavers

    6110 search results - page 11 / 1222
    » Approximate Computing
    Sort
    View
    SAC
    2010
    ACM
    137views Applied Computing» more  SAC 2010»
    Non-linear regression models for Approximate Bayesian Computation
    15 years 2 months ago
    Non-linear regression models for Approximate Bayesian Computation
    Download  www.ceremade.dauphine.fr
    Michael G. B. Blum, Olivier François
    claim paper
    Read More »
    ARITH
    2009
    IEEE
    107views Applied Computing» more  ARITH 2009»
    Certified and Fast Computation of Supremum Norms of Approximation Errors
    15 years 11 months ago
    Certified and Fast Computation of Supremum Norms of Approximation Errors
    Download  lara.inist.fr
    Sylvain Chevillard, Mioara Joldes, Christoph Quiri...
    claim paper
    Read More »
    INFOCOM
    2008
    IEEE
    139views Communications» more  INFOCOM 2008»
    Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints
    15 years 10 months ago
    Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints
    Download  www.cs.umd.edu
    —A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
    Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marat...
    claim paper
    Read More »
    121
    Voted
    FOCS
    1994
    IEEE
    83views Theoretical Computer Science» more  FOCS 1994»
    On Syntactic versus Computational Views of Approximability
    15 years 7 months ago
    On Syntactic versus Computational Views of Approximability
    Download  people.csail.mit.edu
    Sanjeev Khanna, Rajeev Motwani, Madhu Sudan, Umesh...
    claim paper
    Read More »
    ICCSA
    2004
    Springer
    106views Applied Computing» more  ICCSA 2004»
    A Robust and Fast Algorithm for Computing Exact and Approximate Shortest Visiting Routes
    15 years 9 months ago
    A Robust and Fast Algorithm for Computing Exact and Approximate Shortest Visiting Routes
    Download  www.sm.luth.se
    Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...
    Håkan Jonsson
    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.