Sciweavers

    172 search results - page 12 / 35
    » Graph-Based Data Clustering with Overlaps
    Sort
    View
    BMCBI
    2007
    134views more  BMCBI 2007»
    Nearest Neighbor Networks: clustering expression data based on gene neighborhoods
    14 years 11 months ago
    Nearest Neighbor Networks: clustering expression data based on gene neighborhoods
    Download  www.biomedcentral.com
    Background: The availability of microarrays measuring thousands of genes simultaneously across hundreds of biological conditions represents an opportunity to understand both indiv...
    Curtis Huttenhower, Avi I. Flamholz, Jessica N. La...
    claim paper
    Read More »
    BMCBI
    2008
    160views more  BMCBI 2008»
    A comparison of four clustering methods for brain expression microarray data
    14 years 11 months ago
    A comparison of four clustering methods for brain expression microarray data
    Download  www.biomedcentral.com
    Background: DNA microarrays, which determine the expression levels of tens of thousands of genes from a sample, are an important research tool. However, the volume of data they pr...
    Alexander L. Richards, Peter Holmans, Michael C. O...
    claim paper
    Read More »
    SAC
    2009
    ACM
    127views Applied Computing» more  SAC 2009»
    Visualization of clustered directed acyclic graphs with node interleaving
    15 years 6 months ago
    Visualization of clustered directed acyclic graphs with node interleaving
    Download  www.utdallas.edu
    Graph drawing and visualization represent structural information ams of abstract graphs and networks. An important subset of graphs is directed acyclic graphs (DAGs). E-Spring alg...
    Pushpa Kumar, Kang Zhang
    claim paper
    Read More »
    AAAI
    2008
    219views Intelligent Agents» more  AAAI 2008»
    Clustering via Random Walk Hitting Time on Directed Graphs
    15 years 2 months ago
    Clustering via Random Walk Hitting Time on Directed Graphs
    Download  www.aaai.org
    In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
    Mo Chen, Jianzhuang Liu, Xiaoou Tang
    claim paper
    Read More »
    IPPS
    2000
    IEEE
    137views Distributed And Parallel Com...» more  IPPS 2000»
    Reconfigurable Parallel Sorting and Load Balancing on a Beowulf Cluster: HeteroSort
    15 years 4 months ago
    Reconfigurable Parallel Sorting and Load Balancing on a Beowulf Cluster: HeteroSort
    Download  ipdps.cc.gatech.edu
    HeteroSort load balances and sorts within static or dynamic networks using a conceptual torus mesh. We ported HeteroSort to a 16-node Beowulf cluster with a central switch architec...
    Pamela Yang, Timothy M. Kunau, Bonnie Holte Bennet...
    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-2025, USA.