Sciweavers

    TALG
    2008
    93views more  TALG 2008»
    Approximate distance oracles for geometric spanners
    13 years 11 months ago
    Approximate distance oracles for geometric spanners
    Download  people.scs.carleton.ca
    Joachim Gudmundsson, Christos Levcopoulos, Giri Na...
    claim paper
    Read More »
    TALG
    2008
    59views more  TALG 2008»
    Label-guided graph exploration by a finite automaton
    13 years 11 months ago
    Label-guided graph exploration by a finite automaton
    Download  www.liafa.jussieu.fr
    Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, A...
    claim paper
    Read More »
    TALG
    2008
    70views more  TALG 2008»
    Approximation schemes for wireless networks
    13 years 11 months ago
    Approximation schemes for wireless networks
    Download  www.cise.ufl.edu
    Tim Nieberg, Johann Hurink, Walter Kern
    claim paper
    Read More »
    TALG
    2008
    152views more  TALG 2008»
    Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs
    13 years 11 months ago
    Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs
    Download  web.mit.edu
    In the rectangle stabbing problem we are given a set of axis parallel rectangles and a set of horizontal and vertical lines, and our goal is to find a minimum size subset of lines...
    Guy Even, Retsef Levi, Dror Rawitz, Baruch Schiebe...
    claim paper
    Read More »
    TALG
    2008
    80views more  TALG 2008»
    Balanced parentheses strike back
    13 years 11 months ago
    Balanced parentheses strike back
    Download  www.csie.ntu.edu.tw
    Hsueh-I Lu, Chia-Chi Yeh
    claim paper
    Read More »
    TALG
    2008
    110views more  TALG 2008»
    Optimality of an algorithm solving the Bottleneck Tower of Hanoi problem
    13 years 11 months ago
    Optimality of an algorithm solving the Bottleneck Tower of Hanoi problem
    Download  www.cs.bgu.ac.il
    We study the Bottleneck Tower of Hanoi puzzle posed by D. Wood
    Yefim Dinitz, Shay Solomon
    claim paper
    Read More »
    TALG
    2008
    56views more  TALG 2008»
    Determining plurality
    13 years 11 months ago
    Determining plurality
    Download  emr.cs.uiuc.edu
    Laurent Alonso, Edward M. Reingold
    claim paper
    Read More »
    TALG
    2008
    69views more  TALG 2008»
    Testing Euclidean minimum spanning trees in the plane
    13 years 11 months ago
    Testing Euclidean minimum spanning trees in the plane
    Download  www.dcs.warwick.ac.uk
    Given a Euclidean graph G over a set P of n points in the plane, we are interested in verifying whether G is a Euclidean minimum spanning tree (EMST) of P or G differs from it in ...
    Artur Czumaj, Christian Sohler
    claim paper
    Read More »
    TALG
    2008
    97views more  TALG 2008»
    Average-case lower bounds for the plurality problem
    13 years 11 months ago
    Average-case lower bounds for the plurality problem
    Download  emr.cs.uiuc.edu
    Given a set of n elements, each of which is colored one of c 2 colors, we must determine an element of the plurality (most frequently occurring) color by pairwise equal/unequal co...
    Laurent Alonso, Edward M. Reingold
    claim paper
    Read More »
    « first‹ previous123
    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.