Sciweavers

    1974 search results - page 30 / 395
    » On Unbiased Linear Approximations
    Sort
    View
    78
    Voted
    COMBINATORICS
    2007
    112views more  COMBINATORICS 2007»
    Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set
    14 years 9 months ago
    Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set
    Download  iti.mff.cuni.cz
    In the last decade there has been an ongoing interest in string comparison problems; to a large extend the interest was stimulated by genome rearrangement problems in computationa...
    Petr Kolman, Tomasz Walen
    claim paper
    Read More »
    54
    Voted
    JC
    2008
    43views more  JC 2008»
    On the probabilistic complexity of finding an approximate solution for linear programming
    14 years 9 months ago
    On the probabilistic complexity of finding an approximate solution for linear programming
    Download  www.optimization-online.org
    Jun Ji, Florian A. Potra
    claim paper
    Read More »
    56
    Voted
    JNS
    2008
    56views more  JNS 2008»
    New Approximations and Tests of Linear Fluctuation-Response for Chaotic Nonlinear Forced-Dissipative Dynamical Systems
    14 years 9 months ago
    New Approximations and Tests of Linear Fluctuation-Response for Chaotic Nonlinear Forced-Dissipative Dynamical Systems
    Download  math.nyu.edu
    Rafail V. Abramov, Andrew J. Majda
    claim paper
    Read More »
    IEICET
    2007
    50views more  IEICET 2007»
    On Robust Approximate Feedback Linearization with Triangular and Feedforward Forms
    14 years 9 months ago
    On Robust Approximate Feedback Linearization with Triangular and Feedforward Forms
    Download  stcon.kaist.ac.kr
    Ho-Lim Choi, Jong-Tae Lim
    claim paper
    Read More »
    SIAMCOMP
    2008
    77views more  SIAMCOMP 2008»
    A Linear-Time Approximation Scheme for TSP in Undirected Planar Graphs with Edge-Weights
    14 years 9 months ago
    A Linear-Time Approximation Scheme for TSP in Undirected Planar Graphs with Edge-Weights
    Download  www.cs.brown.edu
    We give an algorithm requiring O(c1/2 n) time to find an -optimal traveling salesman tour in the shortest-path metric defined by an undirected planar graph with nonnegative edgele...
    Philip N. Klein
    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.