Sciweavers

    COMPGEOM
    2007
    ACM
    96views Discrete Geometry» more  COMPGEOM 2007»
    Decomposition of multiple coverings into many parts
    14 years 14 days ago
    Decomposition of multiple coverings into many parts
    Download  www.cs.nyu.edu
    János Pach, Géza Tóth
    claim paper
    Read More »
    COMPGEOM
    2007
    ACM
    75views Discrete Geometry» more  COMPGEOM 2007»
    Computing the volume of the union of cubes
    14 years 14 days ago
    Computing the volume of the union of cubes
    Download  www.cs.tau.ac.il
    Pankaj K. Agarwal, Haim Kaplan, Micha Sharir
    claim paper
    Read More »
    COMPGEOM
    2007
    ACM
    107views Discrete Geometry» more  COMPGEOM 2007»
    Embeddings of surfaces, curves, and moving points in euclidean space
    14 years 14 days ago
    Embeddings of surfaces, curves, and moving points in euclidean space
    Download  biogeometry.duke.edu
    In this paper we show that dimensionality reduction (i.e., Johnson-Lindenstrauss lemma) preserves not only the distances between static points, but also between moving points, and...
    Pankaj K. Agarwal, Sariel Har-Peled, Hai Yu
    claim paper
    Read More »
    COMPGEOM
    2007
    ACM
    82views Discrete Geometry» more  COMPGEOM 2007»
    Similar simplices in a d-dimensional point set
    14 years 14 days ago
    Similar simplices in a d-dimensional point set
    Download  biogeometry.duke.edu
    Pankaj K. Agarwal, Roel Apfelbaum, George B. Purdy...
    claim paper
    Read More »
    COMPGEOM
    2007
    ACM
    99views Discrete Geometry» more  COMPGEOM 2007»
    Aperture-angle and Hausdorff-approximation of convex figures
    14 years 14 days ago
    Aperture-angle and Hausdorff-approximation of convex figures
    Download  www.gudmundsson.biz
    Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim...
    claim paper
    Read More »
    COMPGEOM
    2007
    ACM
    106views Discrete Geometry» more  COMPGEOM 2007»
    Querying approximate shortest paths in anisotropic regions
    14 years 14 days ago
    Querying approximate shortest paths in anisotropic regions
    Download  research.microsoft.com
    We present a data structure for answering approximate shortest path queries in a planar subdivision from a fixed source. Let 1 be a real number. Distances in each face of this sub...
    Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Ya...
    claim paper
    Read More »
    COMPGEOM
    2007
    ACM
    115views Discrete Geometry» more  COMPGEOM 2007»
    Probabilistic embeddings of bounded genus graphs into planar graphs
    14 years 14 days ago
    Probabilistic embeddings of bounded genus graphs into planar graphs
    Download  www.mit.edu
    Piotr Indyk, Anastasios Sidiropoulos
    claim paper
    Read More »
    CAAN
    2007
    Springer
    161views Discrete Geometry» more  CAAN 2007»
    Improving the Efficiency of Helsgaun's Lin-Kernighan Heuristic for the Symmetric TSP
    14 years 16 days ago
    Improving the Efficiency of Helsgaun's Lin-Kernighan Heuristic for the Symmetric TSP
    Download  www.informatik.uni-kiel.de
    Abstract. Helsgaun has introduced and implemented the lower tolerances (-values) for an approximation of Held-Karp's 1-tree with the purpose to improve the Lin-Kernighan Heuri...
    Dirk Richter, Boris Goldengorin, Gerold Jäger...
    claim paper
    Read More »
    CAAN
    2007
    Springer
    164views Discrete Geometry» more  CAAN 2007»
    Nonadaptive Selfish Routing with Online Demands
    14 years 16 days ago
    Nonadaptive Selfish Routing with Online Demands
    Download  www.math.tu-berlin.de
    We study the efficiency of selfish routing problems in which traffic demands are revealed online. We go beyond the common Nash equilibrium concept in which possibly all players rer...
    Tobias Harks, László A. Végh
    claim paper
    Read More »
    CAAN
    2007
    Springer
    144views Discrete Geometry» more  CAAN 2007»
    Preemptive Scheduling on Selfish Machines
    14 years 16 days ago
    Preemptive Scheduling on Selfish Machines
    Download  math.haifa.ac.il
    We consider the problem of scheduling on parallel uniformly related machines, where preemptions are allowed and the machines are controlled by selfish agents. Our goal is to minimi...
    Leah Epstein, Rob van Stee
    claim paper
    Read More »
    « first‹ previous…262728293031323334…next ›last »
    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.