Sciweavers

    STOC
    1995
    ACM
    194views Algorithms» more  STOC 1995»
    Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals
    15 years 8 months ago
    Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals
    Download  www.cs.tau.ac.il
    Genomes frequently evolve by reversals ␳(i, j) that transform a gene order ␲1 . . . ␲i␲iϩ1 . . . ␲jϪ1␲j . . . ␲n into ␲1 . . . ␲i␲jϪ1 . . . ␲iϩ1␲j . . ....
    Sridhar Hannenhalli, Pavel A. Pevzner
    claim paper
    Read More »
    COCO
    1995
    Springer
    134views Algorithms» more  COCO 1995»
    Towards Average-Case Complexity Analysis of NP Optimization Problems
    15 years 8 months ago
    Towards Average-Case Complexity Analysis of NP Optimization Problems
    Download  vts.uni-ulm.de
    For the worst-case complexity measure, if P = NP, then P = OptP, i.e., all NP optimization problems are polynomial-time solvable. On the other hand, it is not clear whether a simi...
    Rainer Schuler, Osamu Watanabe
    claim paper
    Read More »
    173
    Voted
    ESA
    1995
    Springer
    182views Algorithms» more  ESA 1995»
    A Geometric Approach to Betweenness
    15 years 8 months ago
    A Geometric Approach to Betweenness
    Download  www.cs.tau.ac.il
    An input to the betweenness problem contains m constraints over n real variables (points). Each constraint consists of three points, where one of the points is specified to lie in...
    Benny Chor, Madhu Sudan
    claim paper
    Read More »
    STOC
    1995
    ACM
    115views Algorithms» more  STOC 1995»
    Geometric lower bounds for parametric matroid optimization
    15 years 8 months ago
    Geometric lower bounds for parametric matroid optimization
    Download  www.ics.uci.edu
    We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
    David Eppstein
    claim paper
    Read More »
    COCO
    1995
    Springer
    115views Algorithms» more  COCO 1995»
    On Approximation Algorithms for Hierarchical MAX-SAT
    15 years 8 months ago
    On Approximation Algorithms for Hierarchical MAX-SAT
    Download  www.ccs.neu.edu
    Sameet Agarwal, Anne Condon
    claim paper
    Read More »
    All Subjects
    Algorithms
    Applied Computing
    Artificial Intelligence
    Automated Reasoning
    Biometrics
    Combinatorics
    Communications
    Computer Animation
    Computer Architecture
    Computer Graphics
    Computer Networks
    Computer Vision
    Control Systems
    Cryptology
    Data Mining
    Database
    Digital Library
    Discrete Geometry
    Distributed And Parallel Computing
    Document Analysis
    Education
    Embedded Systems
    Emerging Technology
    Formal Methods
    FPGA
    GIS
    Hardware
    Human Computer Interaction
    Image Analysis
    Image Processing
    Information Technology
    Intelligent Agents
    Internet Technology
    Knowledge Management
    Machine Learning
    Mathematics
    Medical Imaging
    Modeling and Simulation
    Multimedia
    Natural Language Processing
    Neural Networks
    Operating System
    Programming Languages
    Robotics
    Security Privacy
    Software Engineering
    Solid Modeling
    System Software
    Theoretical Computer Science
    VHDL
    Visual Languages
    Visualization
    VLSI
    Algorithms
    Top of PageReset Settings
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.