Sciweavers

    2570 search results - page 26 / 514
    » Fast Algorithms For The Computation Of Ranklets
    Sort
    View
    FOCS
    1998
    IEEE
    90views Theoretical Computer Science» more  FOCS 1998»
    Fast Monte-Carlo Algorithms for Finding Low-Rank Approximations
    15 years 11 months ago
    Fast Monte-Carlo Algorithms for Finding Low-Rank Approximations
    Download  www-math.mit.edu
    Alan M. Frieze, Ravi Kannan, Santosh Vempala
    claim paper
    Read More »
    FOCS
    1991
    IEEE
    114views Theoretical Computer Science» more  FOCS 1991»
    Fast Approximation Algorithms for Fractional Packing and Covering Problems
    15 years 11 months ago
    Fast Approximation Algorithms for Fractional Packing and Covering Problems
    Download  infolab.stanford.edu
    Serge A. Plotkin, David B. Shmoys, Éva Tard...
    claim paper
    Read More »
    CGF
    2004
    175views more  CGF 2004»
    DiFi: Fast 3D Distance Field Computation Using Graphics Hardware
    15 years 7 months ago
    DiFi: Fast 3D Distance Field Computation Using Graphics Hardware
    Download  gamma.cs.unc.edu
    We present an algorithm for fast computation of discretized 3D distance fields using graphics hardware. Given a set of primitives and a distance metric, our algorithm computes the...
    Avneesh Sud, Miguel A. Otaduy, Dinesh Manocha
    claim paper
    Read More »
    WAW
    2004
    Springer
    124views Algorithms» more  WAW 2004»
    Fast PageRank Computation Via a Sparse Linear System (Extended Abstract)
    16 years 24 days ago
    Fast PageRank Computation Via a Sparse Linear System (Extended Abstract)
    Download  www.di.unipi.it
    ystem (Extended Abstract) Gianna M. Del Corso1 Antonio Gull´ı1,2 Francesco Romani1 1 Dipartimento di Informatica, University of Pisa, Italy 2 IIT-CNR, Pisa
    Gianna M. Del Corso, Antonio Gulli, Francesco Roma...
    claim paper
    Read More »
    IPL
    2011
    91views more  IPL 2011»
    Fast leader election in anonymous rings with bounded expected delay
    14 years 11 months ago
    Fast leader election in anonymous rings with bounded expected delay
    Download  www.few.vu.nl
    We propose a probabilistic network model, called asynchronous bounded expected delay (ABE), which requires a known bound on the expected message delay. In ABE networks all asynchr...
    Rena Bakhshi, Jörg Endrullis, Wan Fokkink, Ju...
    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.