Sciweavers

    895 search results - page 82 / 179
    » Approximate convex decomposition
    Sort
    View
    COMGEO
    2006
    ACM
    114views Applied Computing» more  COMGEO 2006»
    A new algorithmic approach to the computation of Minkowski functionals of polyconvex sets
    14 years 10 months ago
    A new algorithmic approach to the computation of Minkowski functionals of polyconvex sets
    Download  www.mathematik.uni-ulm.de
    An algorithm is proposed for the simultaneous computation of all Minkowski functionals (except for the volume) of sets from the convex ring in Rd discretized with respect to a give...
    Simone Klenk, Volker Schmidt, Evgueni Spodarev
    claim paper
    Read More »
    CG
    2005
    Springer
    181views Computer Graphics» more  CG 2005»
    Computing geodesics on triangular meshes
    14 years 9 months ago
    Computing geodesics on triangular meshes
    Download  www.visgraf.impa.br
    We present a new algorithm to compute a geodesic path over a triangulated surface. Based on Sethian's Fast Marching Method and Polthier's Straightest Geodesics theory, w...
    Dimas Martínez Morera, Luiz Velho, Paulo Ce...
    claim paper
    Read More »
    WWW
    2005
    ACM
    109views Internet Technology» more  WWW 2005»
    On the feasibility of low-rank approximation for personalized PageRank
    15 years 10 months ago
    On the feasibility of low-rank approximation for personalized PageRank
    Download  www.www2005.org
    Personalized PageRank expresses backlink-based page quality around user-selected pages in a similar way to PageRank over the entire Web. Algorithms for computing personalized Page...
    András A. Benczúr, Károly Csa...
    claim paper
    Read More »
    DAGSTUHL
    2010
    143views Software Engineering» more  DAGSTUHL 2010»
    On Curved Simplicial Elements and Best Quadratic Spline Approximation for Hierarchical Data Representation
    14 years 11 months ago
    On Curved Simplicial Elements and Best Quadratic Spline Approximation for Hierarchical Data Representation
    Download  graphics.cs.ucdavis.edu
    We present a method for hierarchical data approximation using curved quadratic simplicial elements for domain decomposition. Scientific data defined over two- or three-dimensional ...
    Bernd Hamann
    claim paper
    Read More »
    TSP
    2008
    178views more  TSP 2008»
    Heteroscedastic Low-Rank Matrix Approximation by the Wiberg Algorithm
    14 years 9 months ago
    Heteroscedastic Low-Rank Matrix Approximation by the Wiberg Algorithm
    Download  sist.sysu.edu.cn
    Abstract--Low-rank matrix approximation has applications in many fields, such as 2D filter design and 3D reconstruction from an image sequence. In this paper, one issue with low-ra...
    Pei Chen
    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-2025, USA.