Sciweavers

    74 search results - page 10 / 15
    » The Complexity of Black-Box Ring Problems
    Sort
    View
    DM
    2008
    86views more  DM 2008»
    "Catalan traffic" and integrals on the Grassmannian of lines
    13 years 9 months ago
    "Catalan traffic" and integrals on the Grassmannian of lines
    Download  calvino.polito.it
    One proves that certain numbers occurring in a problem of paths enumeration, studied by Niederhausen in [7] (see also [10]), are top intersection numbers in the cohomology ring of...
    Taíse Santiago Costa Oliveira
    claim paper
    Read More »
    JSAC
    2006
    157views more  JSAC 2006»
    Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms
    13 years 9 months ago
    Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms
    Download  www-sop.inria.fr
    We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
    Shu Huang, Rudra Dutta, George N. Rouskas
    claim paper
    Read More »
    COCOON
    2006
    Springer
    119views Combinatorics» more  COCOON 2006»
    Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms
    14 years 26 days ago
    Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms
    Download  www.cdm.depaul.edu
    In a recent article, Nakhleh, Ringe and Warnow introduced perfect phylogenetic networks--a model of language evolution where languages do not evolve via clean speciation--and form...
    Iyad A. Kanj, Luay Nakhleh, Ge Xia
    claim paper
    Read More »
    IJACTAICIT
    2010
    160views more  IJACTAICIT 2010»
    Concentric Circular Array Antenna Null Steering Synthesis by Using Modified Hybrid Ant Colony System Algorithm
    13 years 6 months ago
    Concentric Circular Array Antenna Null Steering Synthesis by Using Modified Hybrid Ant Colony System Algorithm
    Download  www.aicit.org
    In this article, a hybrid optimization method has been proposed consisting of modified ant colony systems (ACSs) and constrained nonlinear programming (NLP) to solve the problems ...
    Ali Abdulhadi Noaman
    claim paper
    Read More »
    ECCC
    2008
    168views more  ECCC 2008»
    Algebrization: A New Barrier in Complexity Theory
    13 years 9 months ago
    Algebrization: A New Barrier in Complexity Theory
    Download  www.scottaaronson.com
    Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
    Scott Aaronson, Avi Wigderson
    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.