Sciweavers

    473 search results - page 5 / 95
    » Computing excluded minors
    Sort
    View
    ICPR
    2006
    IEEE
    124views computer vision» more  ICPR 2006»
    Minimum Enclosing and Maximum Excluding Machine for Pattern Description and Discrimination
    14 years 8 months ago
    Minimum Enclosing and Maximum Excluding Machine for Pattern Description and Discrimination
    Download  www.stat.umn.edu
    Yi Liu, Yuan F. Zheng
    claim paper
    Read More »
    DAC
    1994
    ACM
    98views Computer Architecture» more  DAC 1994»
    OTTER: Optimal Termination of Transmission Lines Excluding Radiation
    13 years 11 months ago
    OTTER: Optimal Termination of Transmission Lines Excluding Radiation
    Download  www.cs.york.ac.uk
    Rohini Gupta, Lawrence T. Pillage
    claim paper
    Read More »
    BMCBI
    2008
    89views more  BMCBI 2008»
    Increasing the efficiency of bacterial transcription simulations: When to exclude the genome without loss of accuracy
    13 years 7 months ago
    Increasing the efficiency of bacterial transcription simulations: When to exclude the genome without loss of accuracy
    Download  www.biomedcentral.com
    Background: Simulating the major molecular events inside an Escherichia coli cell can lead to a very large number of reactions that compose its overall behaviour. Not only should ...
    Marco A. J. Iafolla, Guang Qiang Dong, David R. Mc...
    claim paper
    Read More »
    STOC
    2009
    ACM
    171views Algorithms» more  STOC 2009»
    On the geometry of graphs with a forbidden minor
    14 years 8 months ago
    On the geometry of graphs with a forbidden minor
    Download  people.csail.mit.edu
    We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
    James R. Lee, Anastasios Sidiropoulos
    claim paper
    Read More »
    STACS
    2010
    Springer
    172views Theoretical Computer Science» more  STACS 2010»
    Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs
    14 years 2 months ago
    Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs
    Download  www.ii.uib.no
    In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
    Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, ...
    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-2024, USA.