Sciweavers

    TCS
    2008
    67views Theoretical Computer Science» more  TCS 2008»
    A randomized algorithm for the joining protocol in dynamic distributed networks
    13 years 11 months ago
    A randomized algorithm for the joining protocol in dynamic distributed networks
    Download  www.dcs.kcl.ac.uk
    Colin Cooper, Ralf Klasing, Tomasz Radzik
    claim paper
    Read More »
    TCS
    2008
    98views Theoretical Computer Science» more  TCS 2008»
    Finding a minimum medial axis of a discrete shape is NP-hard
    13 years 11 months ago
    Finding a minimum medial axis of a discrete shape is NP-hard
    Download  liris.cnrs.fr
    The medial axis is a classical representation of digital objects widely used in many applications. However, such a set of balls may not be optimal: subsets of the medial axis may ...
    David Coeurjolly, Jérôme Hulin, Isabe...
    claim paper
    Read More »
    TCS
    2008
    78views Theoretical Computer Science» more  TCS 2008»
    The supercover of an m-flat is a discrete analytical object
    13 years 11 months ago
    The supercover of an m-flat is a discrete analytical object
    Download  hal.archives-ouvertes.fr
    The aim of this paper is to show that the supercover of an m-flat (i.e. a Euclidean affine subspace of dimension m) in Euclidean n-space is a discrete analytical object. The super...
    Eric Andres
    claim paper
    Read More »
    TCS
    2008
    116views Theoretical Computer Science» more  TCS 2008»
    Reconstruction of convex lattice sets from tomographic projections in quartic time
    13 years 11 months ago
    Reconstruction of convex lattice sets from tomographic projections in quartic time
    Download  lsiit-cnrs.unistra.fr
    Filling operations are procedures which are used in Discrete Tomography for the reconstruction of lattice sets having some convexity constraints. Many algorithms have been publish...
    Sara Brunetti, Alain Daurat
    claim paper
    Read More »
    TCS
    2008
    97views Theoretical Computer Science» more  TCS 2008»
    On the complexity of bandwidth allocation in radio networks
    13 years 11 months ago
    On the complexity of bandwidth allocation in radio networks
    Download  hal.archives-ouvertes.fr
    Ralf Klasing, Nelson Morales, Stéphane P&ea...
    claim paper
    Read More »
    TCS
    2008
    92views Theoretical Computer Science» more  TCS 2008»
    Fine hierarchies and m-reducibilities in theoretical computer science
    13 years 11 months ago
    Fine hierarchies and m-reducibilities in theoretical computer science
    Download  haegar.informatik.uni-wuerzburg.de
    This is a survey of results about versions of fine hierarchies and many-one reducibilities that appear in different parts of theoretical computer science. These notions and relate...
    Victor L. Selivanov
    claim paper
    Read More »
    TCS
    2008
    84views Theoretical Computer Science» more  TCS 2008»
    Static space-times naturally lead to quasi-pseudometrics
    13 years 11 months ago
    Static space-times naturally lead to quasi-pseudometrics
    Download  www.cs.utep.edu
    The standard 4-dimensional Minkowski space-time of special relativity is based on the 3-dimensional Euclidean metric. In 1967, H. Busemann showed that similar static space-time mo...
    Hans-Peter A. Künzi, Vladik Kreinovich
    claim paper
    Read More »
    TCS
    2008
    99views Theoretical Computer Science» more  TCS 2008»
    Information systems revisited - the general continuous case
    13 years 11 months ago
    Information systems revisited - the general continuous case
    Download  www.uni-siegen.de
    In this paper a new notion of continuous information system is introduced. It is shown that the information systems of this kind generate exactly the continuous domains. The new i...
    Dieter Spreen, Luoshan Xu, Xuxin Mao
    claim paper
    Read More »
    TCS
    2008
    163views Theoretical Computer Science» more  TCS 2008»
    Kernel methods for learning languages
    13 years 11 months ago
    Kernel methods for learning languages
    Download  www.cs.nyu.edu
    This paper studies a novel paradigm for learning formal languages from positive and negative examples which consists of mapping strings to an appropriate highdimensional feature s...
    Leonid Kontorovich, Corinna Cortes, Mehryar Mohri
    claim paper
    Read More »
    TCS
    2008
    104views Theoretical Computer Science» more  TCS 2008»
    Automatic generation of path conditions for concurrent timed systems
    13 years 11 months ago
    Automatic generation of path conditions for concurrent timed systems
    Download  www-verimag.imag.fr
    Saddek Bensalem, Doron Peled, Hongyang Qu, Stavros...
    claim paper
    Read More »
    « first‹ previous123456789…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.