Sciweavers

    545 search results - page 10 / 109
    » Simultaneous approximation by greedy algorithms
    Sort
    View
    ICIP
    2007
    IEEE
    106views Image Processing» more  ICIP 2007»
    Locally Competitive Algorithms for Sparse Approximation
    14 years 2 months ago
    Locally Competitive Algorithms for Sparse Approximation
    Download  www.ece.rice.edu
    Practical sparse approximation algorithms (particularly greedy algorithms) suffer two significant drawbacks: they are difficult to implement in hardware, and they are inefficie...
    Christopher J. Rozell, Don H. Johnson, Richard G. ...
    claim paper
    Read More »
    EOR
    2007
    117views more  EOR 2007»
    Simultaneous perturbation stochastic approximation of nonsmooth functions
    13 years 8 months ago
    Simultaneous perturbation stochastic approximation of nonsmooth functions
    Download  www.jhuapl.edu
    A simultaneous perturbation stochastic approximation (SPSA) method has been developed in this paper, using the operators of perturbation with the Lipschitz density function. This ...
    Vaida Bartkute, Leonidas Sakalauskas
    claim paper
    Read More »
    LCN
    1999
    IEEE
    106views Computer Networks» more  LCN 1999»
    The New Shortest Best Path Tree (SBPT) Algorithm for Dynamic Multicast Trees
    14 years 22 days ago
    The New Shortest Best Path Tree (SBPT) Algorithm for Dynamic Multicast Trees
    Download  www.siue.edu
    This paper presents the new Shortest Best Path Tree (SBPT) algorithm for multicast trees. The SBPT algorithm establishes and maintains dynamic multicast trees which maximize the b...
    Hiroshi Fujinoki, Kenneth J. Christensen
    claim paper
    Read More »
    FCT
    2007
    Springer
    151views Applied Computing» more  FCT 2007»
    On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time
    14 years 10 days ago
    On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time
    Download  ccc.cs.uni-duesseldorf.de
    We investigate issues regarding two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chris...
    Gábor Erdélyi, Lane A. Hemaspaandra,...
    claim paper
    Read More »
    JCO
    2010
    169views more  JCO 2010»
    An almost four-approximation algorithm for maximum weight triangulation
    13 years 6 months ago
    An almost four-approximation algorithm for maximum weight triangulation
    Download  www.ece.mtu.edu
    We consider the following planar maximum weight triangulation (MAT) problem: given a set of n points in the plane, find a triangulation such that the total length of edges in tria...
    Shiyan Hu
    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.