Sciweavers

    574 search results - page 21 / 115
    » Approximation Algorithms for Free-Label Maximization
    Sort
    View
    CORR
    2010
    Springer
    107views Education» more  CORR 2010»
    Maximum Betweenness Centrality: Approximability and Tractable Cases
    13 years 7 months ago
    Maximum Betweenness Centrality: Approximability and Tractable Cases
    Download  www1.informatik.uni-wuerzburg.de
    The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
    Martin Fink, Joachim Spoerhase
    claim paper
    Read More »
    INFOCOM
    2012
    IEEE
    219views Communications» more  INFOCOM 2012»
    Reverse-engineering BitTorrent: A Markov approximation perspective
    11 years 11 months ago
    Reverse-engineering BitTorrent: A Markov approximation perspective
    Download  www.eecs.berkeley.edu
    Abstract—BitTorrent has been the most popular P2P (Peer-toPeer) paradigm during recent years. Built upon great intuition, the piece-selection and neighbor-selection modules roote...
    Ziyu Shao, Hao Zhang, Minghua Chen, Kannan Ramchan...
    claim paper
    Read More »
    COMPGEOM
    2007
    ACM
    121views Discrete Geometry» more  COMPGEOM 2007»
    Bi-criteria linear-time approximations for generalized k-mean/median/center
    14 years 16 days ago
    Bi-criteria linear-time approximations for generalized k-mean/median/center
    Download  www.cs.tau.ac.il
    We consider the problem of approximating a set P of n points in Rd by a collection of j-dimensional flats, and extensions thereof, under the standard median / mean / center measur...
    Dan Feldman, Amos Fiat, Micha Sharir, Danny Segev
    claim paper
    Read More »
    CATS
    2006
    167views Applied Computing» more  CATS 2006»
    On the Approximability of Maximum and Minimum Edge Clique Partition Problems
    13 years 10 months ago
    On the Approximability of Maximum and Minimum Edge Clique Partition Problems
    Download  crpit.com
    We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number...
    Anders Dessmark, Jesper Jansson, Andrzej Lingas, E...
    claim paper
    Read More »
    JGO
    2010
    72views more  JGO 2010»
    Strong convergence theorem by a hybrid extragradient-like approximation method for variational inequalities and fixed point prob
    13 years 7 months ago
    Strong convergence theorem by a hybrid extragradient-like approximation method for variational inequalities and fixed point prob
    Download  www.math.nsysu.edu.tw
    The purpose of this paper is to investigate the problem of finding a common element of the set of fixed points F(S) of a nonexpansive mapping S and the set of solutions ΩA of t...
    Lu-Chuan Ceng, Nicolas Hadjisavvas, Ngai-Ching Won...
    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.