Sciweavers

    499 search results - page 13 / 100
    » A Search Algorithm for Clusters in a Network or Graph
    Sort
    View
    ICML
    2007
    IEEE
    165views Machine Learning» more  ICML 2007»
    Graph clustering with network structure indices
    14 years 8 months ago
    Graph clustering with network structure indices
    Download  www.machinelearning.org
    Graph clustering has become ubiquitous in the study of relational data sets. We examine two simple algorithms: a new graphical adaptation of the k-medoids algorithm and the Girvan...
    Matthew J. Rattigan, Marc Maier, David Jensen
    claim paper
    Read More »
    ISCAPDCS
    2007
    117views Distributed And Parallel Com...» more  ISCAPDCS 2007»
    A Node-to-set cluster-fault-tolerant disjoint routing algorithm in pancake graphs
    13 years 9 months ago
    A Node-to-set cluster-fault-tolerant disjoint routing algorithm in pancake graphs
    Download  cis.k.hosei.ac.jp
    With rapid increase of parallel computation systems in their sizes, it is inevitable to develop algorithms that are applicable even if there exist faulty elements in the systems. ...
    Tatsuro Watanabe, Keiichi Kaneko, Shietung Peng
    claim paper
    Read More »
    MOBIHOC
    2002
    ACM
    214views Computer Networks» more  MOBIHOC 2002»
    Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
    14 years 7 months ago
    Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
    Download  www.cs.mun.ca
    We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
    Yuanzhu Peter Chen, Arthur L. Liestman
    claim paper
    Read More »
    KDD
    2004
    ACM
    137views Data Mining» more  KDD 2004»
    Mining scale-free networks using geodesic clustering
    14 years 28 days ago
    Mining scale-free networks using geodesic clustering
    Download  www.cs.uiuc.edu
    Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
    Andrew Y. Wu, Michael Garland, Jiawei Han
    claim paper
    Read More »
    IEEECIT
    2009
    IEEE
    184views Information Technology» more  IEEECIT 2009»
    Clustering of Software Systems Using New Hybrid Algorithms
    14 years 2 months ago
    Clustering of Software Systems Using New Hybrid Algorithms
    Download  ceit.aut.ac.ir
    —Software clustering is a method for increasing software system understanding and maintenance. Software designers, first use MDG graph to model the structure of software system. ...
    Ali Safari Mamaghani, Mohammad Reza Meybodi
    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.