Sciweavers

    316 search results - page 53 / 64
    » Resource Combinatory Algebras
    Sort
    View
    COMPGEOM
    2010
    ACM
    159views Discrete Geometry» more  COMPGEOM 2010»
    A kinetic triangulation scheme for moving points in the plane
    14 years 14 days ago
    A kinetic triangulation scheme for moving points in the plane
    Download  www.math.tau.ac.il
    We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
    Haim Kaplan, Natan Rubin, Micha Sharir
    claim paper
    Read More »
    COMPGEOM
    2010
    ACM
    137views Discrete Geometry» more  COMPGEOM 2010»
    Kinetic stable Delaunay graphs
    14 years 14 days ago
    Kinetic stable Delaunay graphs
    Download  www.math.tau.ac.il
    The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
    Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Ha...
    claim paper
    Read More »
    CSREASAM
    2003
    151views Security Privacy» more  CSREASAM 2003»
    Randomized Traitor Tracing Algorithms for Broadcast Security
    13 years 8 months ago
    Randomized Traitor Tracing Algorithms for Broadcast Security
    Download  user.gs.rmit.edu.au
    We introduce and analyze a randomized traitor tracing algorithm for broadcast security. This algorithm is very efficient compared to brute force methods (the mean time it takes is...
    Simon McNicol, Serdar Boztas
    claim paper
    Read More »
    SIROCCO
    2003
    169views Information Technology» more  SIROCCO 2003»
    The Cost of Concurrent, Low-Contention Read-Modify-Write
    13 years 8 months ago
    The Cost of Concurrent, Low-Contention Read-Modify-Write
    Download  www.csc.lsu.edu
    In this work, we embark on a study of the possibility (or impossibility), and the corresponding costs, of devising concurrent, low-contention implementations of atomic Read-Modify...
    Costas Busch, Marios Mavronicolas, Paul G. Spiraki...
    claim paper
    Read More »
    SMA
    2010
    ACM
    231views Solid Modeling» more  SMA 2010»
    Fast and robust retrieval of Minkowski sums of rotating convex polyhedra in 3-space
    13 years 7 months ago
    Fast and robust retrieval of Minkowski sums of rotating convex polyhedra in 3-space
    Download  www.cs.tau.ac.il
    We present a novel method for fast retrieval of exact Minkowski sums of pairs of convex polytopes in R3 , where one of the polytopes keeps rotating. The algorithm is based on pre-...
    Naama Mayer, Efi Fogel, Dan Halperin
    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.