Sciweavers

    1998 search results - page 344 / 400
    » Complexity of the Cover Polynomial
    Sort
    View
    TPDS
    2008
    72views more  TPDS 2008»
    Replica Placement and Access Policies in Tree Networks
    13 years 9 months ago
    Replica Placement and Access Policies in Tree Networks
    Download  graal.ens-lyon.fr
    In this paper, we discuss and compare several policies to place replicas in tree networks, subject to server capacity and Quality of Service (QoS) constraints. The client requests ...
    Anne Benoit, Veronika Rehn-Sonigo, Yves Robert
    claim paper
    Read More »
    TSP
    2008
    109views more  TSP 2008»
    Code Design to Optimize Radar Detection Performance Under Accuracy and Similarity Constraints
    13 years 9 months ago
    Code Design to Optimize Radar Detection Performance Under Accuracy and Similarity Constraints
    Download  www.se.cuhk.edu.hk
    This paper deals with the design of coded waveforms which optimize radar performances in the presence of colored Gaussian disturbance. We focus on the class of linearly coded puls...
    Antonio De Maio, Silvio De Nicola, Yongwei Huang, ...
    claim paper
    Read More »
    JSCIC
    2007
    89views more  JSCIC 2007»
    Adjoint Recovery of Superconvergent Linear Functionals from Galerkin Approximations. The One-dimensional Case
    13 years 9 months ago
    Adjoint Recovery of Superconvergent Linear Functionals from Galerkin Approximations. The One-dimensional Case
    Download  static.msi.umn.edu
    In this paper, we extend the adjoint error correction of Pierce and Giles [SIAM Review, 42 (2000), pp. 247-264] for obtaining superconvergent approximations of functionals to Gale...
    Bernardo Cockburn, Ryuhei Ichikawa
    claim paper
    Read More »
    SIAMCOMP
    2000
    104views more  SIAMCOMP 2000»
    On the Difficulty of Designing Good Classifiers
    13 years 9 months ago
    On the Difficulty of Designing Good Classifiers
    Download  www.mathcs.emory.edu
    We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...
    Michelangelo Grigni, Vincent Mirelli, Christos H. ...
    claim paper
    Read More »
    DAM
    1999
    128views more  DAM 1999»
    Graph Classes Between Parity and Distance-hereditary Graphs
    13 years 9 months ago
    Graph Classes Between Parity and Distance-hereditary Graphs
    Download  ing.univaq.it
    Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
    Serafino Cicerone, Gabriele Di Stefano
    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.