Sciweavers

    244 search results - page 3 / 49
    » General Refinement, Part Two: Flexible Refinement
    Sort
    View
    SGP
    2007
    162views Computer Graphics» more  SGP 2007»
    Triangulations with locally optimal Steiner points
    13 years 10 months ago
    Triangulations with locally optimal Steiner points
    Download  www.cs.berkeley.edu
    We present two new Delaunay refinement algorithms, second an extension of the first. For a given input domain (a set of points or a planar straight line graph), and a threshold an...
    Hale Erten, Alper Üngör
    claim paper
    Read More »
    PPSC
    2001
    122views Distributed And Parallel Com...» more  PPSC 2001»
    Parallel Adaptive Blocks on a Sphere
    13 years 8 months ago
    Parallel Adaptive Blocks on a Sphere
    Download  www.eecs.umich.edu
    We have developed a flexible tool for efficient parallel adaptive mesh refinement on a sphere. Adaptive mesh refinement allows one to concentrate computational resources on region...
    Robert H. Oehmke, Quentin F. Stout
    claim paper
    Read More »
    JUCS
    2008
    147views more  JUCS 2008»
    On BCK Algebras - Part I.b: An Attempt to Treat Unitarily the Algebras of Logic. New Algebras
    13 years 7 months ago
    On BCK Algebras - Part I.b: An Attempt to Treat Unitarily the Algebras of Logic. New Algebras
    Download  www.jucs.org
    : Since all the algebras connected to logic have, more or less explicitely, an associated order relation, it follows that they have two presentations, dual to each other. We classi...
    Afrodita Iorgulescu
    claim paper
    Read More »
    DAC
    2002
    ACM
    113views Computer Architecture» more  DAC 2002»
    Transformation based communication and clock domain refinement for system design
    14 years 8 months ago
    Transformation based communication and clock domain refinement for system design
    Download  web.it.kth.se
    The ForSyDe methodology has been developed for system level design. In this paper we present formal transformation methods for the refinement of an abstract and formal system mode...
    Ingo Sander, Axel Jantsch
    claim paper
    Read More »
    CORR
    2008
    Springer
    108views Education» more  CORR 2008»
    Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning
    13 years 7 months ago
    Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning
    Download  www.math.ucsd.edu
    Resolution refinements called w-resolution trees with lemmas (WRTL) and with input lemmas (WRTI) are introduced. Dag-like resolution is equivalent to both WRTL and WRTI when there...
    Samuel R. Buss, Jan Hoffmann 0002, Jan Johannsen
    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.