Sciweavers

    23 search results - page 3 / 5
    » Parametric Duality and Kernelization: Lower Bounds and Upper...
    Sort
    View
    NIPS
    2008
    149views Information Technology» more  NIPS 2008»
    Theory of matching pursuit
    13 years 7 months ago
    Theory of matching pursuit
    Download  eprints.pascal-network.org
    We analyse matching pursuit for kernel principal components analysis (KPCA) by proving that the sparse subspace it produces is a sample compression scheme. We show that this bound...
    Zakria Hussain, John Shawe-Taylor
    claim paper
    Read More »
    MASCOTS
    2007
    113views Modeling And Simulation» more  MASCOTS 2007»
    Stochastic Bounds Applied to the End to End QoS in Communication Systems
    13 years 7 months ago
    Stochastic Bounds Applied to the End to End QoS in Communication Systems
    Download  lacl.univ-paris12.fr
    —1 End to end QoS of communication systems is essential for users but their performance evaluation is a complex issue. The ion of such systems are usually given by multidimension...
    Hind Castel, Lynda Mokdad, Nihal Pekergin
    claim paper
    Read More »
    COMPGEOM
    1995
    ACM
    122views Discrete Geometry» more  COMPGEOM 1995»
    Searching for the Kernel of a Polygon - A Competitive Strategy
    13 years 9 months ago
    Searching for the Kernel of a Polygon - A Competitive Strategy
    Download  www.pi6.fernuni-hagen.de
    We present a competitive strategy for walking into the kernel of an initially unknown star-shaped polygon. From an arbitrary start point, s, within the polygon, our strategy find...
    Christian Icking, Rolf Klein
    claim paper
    Read More »
    JMLR
    2012
    187views Programming Languages» more  JMLR 2012»
    Minimax-Optimal Rates For Sparse Additive Models Over Kernel Classes Via Convex Programming
    11 years 8 months ago
    Minimax-Optimal Rates For Sparse Additive Models Over Kernel Classes Via Convex Programming
    Download  www.eecs.berkeley.edu
    Sparse additive models are families of d-variate functions with the additive decomposition f∗ = ∑j∈S f∗ j , where S is an unknown subset of cardinality s d. In this paper,...
    Garvesh Raskutti, Martin J. Wainwright, Bin Yu
    claim paper
    Read More »
    SODA
    2012
    ACM
    170views Algorithms» more  SODA 2012»
    Compression via matroids: a randomized polynomial kernel for odd cycle transversal
    11 years 8 months ago
    Compression via matroids: a randomized polynomial kernel for odd cycle transversal
    Download  siam.omnibooksonline.com
    The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
    Stefan Kratsch, Magnus Wahlström
    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.