Sciweavers

    1949 search results - page 23 / 390
    » Random graphs on surfaces
    Sort
    View
    JCT
    2007
    108views more  JCT 2007»
    The cover time of the preferential attachment graph
    14 years 11 months ago
    The cover time of the preferential attachment graph
    Download  www.math.cmu.edu
    The preferential attachment graph Gm(n) is a random graph formed by adding a new vertex at each time step, with m edges which point to vertices selected at random with probability...
    Colin Cooper, Alan M. Frieze
    claim paper
    Read More »
    SIGGRAPH
    1994
    ACM
    102views Computer Graphics» more  SIGGRAPH 1994»
    Using particles to sample and control implicit surfaces
    15 years 3 months ago
    Using particles to sample and control implicit surfaces
    Download  www.cs.cmu.edu
    We present a new particle-based approach to sampling and controlling implicit surfaces. A simple constraint locks a set of particles onto a surface while the particles and the sur...
    Andrew P. Witkin, Paul S. Heckbert
    claim paper
    Read More »
    STOC
    2002
    ACM
    124views Algorithms» more  STOC 2002»
    Clairvoyant scheduling of random walks
    16 years 2 days ago
    Clairvoyant scheduling of random walks
    Download  www.cs.bu.edu
    Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler a...
    Péter Gács
    claim paper
    Read More »
    COMPGEOM
    1995
    ACM
    117views Discrete Geometry» more  COMPGEOM 1995»
    Representation and Computation of Boolean Combinations of Sculptured Models
    15 years 3 months ago
    Representation and Computation of Boolean Combinations of Sculptured Models
    Download  public.research.att.com
    We outline an algorithm and implementation of a system that computes Boolean combinations of sculptured solids. We represent the surface of the solids in terms of trimmed and untr...
    Shankar Krishnan, Atul Narkhede, Dinesh Manocha
    claim paper
    Read More »
    DM
    2007
    59views more  DM 2007»
    Non-existence of nonorientable regular embeddings of n-dimensional cubes
    14 years 11 months ago
    Non-existence of nonorientable regular embeddings of n-dimensional cubes
    Download  www.savbb.sk
    By a regular embedding of a graph K into a surface we mean a 2-cell embedding of K into a compact connected surface with the automorphism group acting regularly on flags. Regular...
    Young Soo Kwon, Roman Nedela
    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.