Sciweavers

    3096 search results - page 20 / 620
    » The Generalized FITC Approximation
    Sort
    View
    MP
    2008
    104views more  MP 2008»
    Approximation algorithms for general packing problems and their application to the multicast congestion problem
    13 years 8 months ago
    Approximation algorithms for general packing problems and their application to the multicast congestion problem
    Download  www.ece.mtu.edu
    Klaus Jansen, Hu Zhang
    claim paper
    Read More »
    ADCM
    2005
    58views more  ADCM 2005»
    Explicit construction of general multivariate Padé approximants to an Appell function
    13 years 8 months ago
    Explicit construction of general multivariate Padé approximants to an Appell function
    Download  www.cecm.sfu.ca
    Peter B. Borwein, Annie A. M. Cuyt, P. Zhou
    claim paper
    Read More »
    TALG
    2008
    86views more  TALG 2008»
    Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut
    13 years 8 months ago
    Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut
    Download  www.dcs.warwick.ac.uk
    In this paper, we study the metrics of negative type, which are metrics (V, d) such that d is an Euclidean metric; these metrics are thus also known as " 2-squared" met...
    Shuchi Chawla, Anupam Gupta, Harald Räcke
    claim paper
    Read More »
    DAM
    1999
    169views more  DAM 1999»
    Approximating the Weight of Shallow Steiner Trees
    13 years 8 months ago
    Approximating the Weight of Shallow Steiner Trees
    Download  crab.rutgers.edu
    This paper deals with the problem of constructing Steiner trees of minimum weight with diameter bounded by d, spanning a given set of vertices in a graph. Exact solutions or logar...
    Guy Kortsarz, David Peleg
    claim paper
    Read More »
    SDM
    2011
    SIAM
    414views Data Mining» more  SDM 2011»
    Clustered low rank approximation of graphs in information science applications
    12 years 11 months ago
    Clustered low rank approximation of graphs in information science applications
    Download  www.cs.utexas.edu
    In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
    Berkant Savas, Inderjit S. Dhillon
    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.