Sciweavers

    165 search results - page 3 / 33
    » Dominant Sets and Pairwise Clustering
    Sort
    View
    JPDC
    2007
    191views more  JPDC 2007»
    Clustering wireless ad hoc networks with weakly connected dominating set
    13 years 5 months ago
    Clustering wireless ad hoc networks with weakly connected dominating set
    Download  anyserver.cityu.edu.hk
    The increasing popular personal communications and mobile computing require a wireless network infrastructure that supports selfconfiguration and self-management. Efficient clus...
    Bo Han, Weijia Jia
    claim paper
    Read More »
    IPPS
    2005
    IEEE
    125views Distributed And Parallel Com...» more  IPPS 2005»
    Maximizing the Lifetime of Dominating Sets
    13 years 11 months ago
    Maximizing the Lifetime of Dominating Sets
    Download  research.microsoft.com
    We investigate the problem of maximizing the lifetime of wireless ad hoc and sensor networks. Being battery powered, nodes in such networks have to perform their intended task und...
    Thomas Moscibroda, Roger Wattenhofer
    claim paper
    Read More »
    SDM
    2009
    SIAM
    225views Data Mining» more  SDM 2009»
    Integrated KL (K-means - Laplacian) Clustering: A New Clustering Approach by Combining Attribute Data and Pairwise Relations.
    14 years 2 months ago
    Integrated KL (K-means - Laplacian) Clustering: A New Clustering Approach by Combining Attribute Data and Pairwise Relations.
    Download  siam.org
    Most datasets in real applications come in from multiple sources. As a result, we often have attributes information about data objects and various pairwise relations (similarity) ...
    Fei Wang, Chris H. Q. Ding, Tao Li
    claim paper
    Read More »
    SDM
    2009
    SIAM
    167views Data Mining» more  SDM 2009»
    Parallel Pairwise Clustering.
    14 years 2 months ago
    Parallel Pairwise Clustering.
    Download  www.siam.org
    Given the pairwise affinity relations associated with a set of data items, the goal of a clustering algorithm is to automatically partition the data into a small number of homogen...
    Elad Yom-Tov, Noam Slonim
    claim paper
    Read More »
    COLING
    2010
    116views Computational Linguistics» more  COLING 2010»
    Streaming Cross Document Entity Coreference Resolution
    13 years 19 days ago
    Streaming Cross Document Entity Coreference Resolution
    Download  www.cs.jhu.edu
    Previous research in cross-document entity coreference has generally been restricted to the offline scenario where the set of documents is provided in advance. As a consequence, t...
    Delip Rao, Paul McNamee, Mark Dredze
    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.