Sciweavers

    77 search results - page 16 / 16
    » Probabilistic Communication Complexity Over The Reals
    Sort
    View
    STOC
    2009
    ACM
    145views Algorithms» more  STOC 2009»
    Finding, minimizing, and counting weighted subgraphs
    14 years 5 months ago
    Finding, minimizing, and counting weighted subgraphs
    Download  www.math.ias.edu
    d Abstract] Virginia Vassilevska School of Mathematics Institute for Advanced Study Princeton, NJ 08540 USA virgi@math.ias.edu Ryan Williams School of Mathematics Institute for Adv...
    Virginia Vassilevska, Ryan Williams
    claim paper
    Read More »
    ICPP
    2000
    IEEE
    205views Distributed And Parallel Com...» more  ICPP 2000»
    A Scalable Parallel Subspace Clustering Algorithm for Massive Data Sets
    13 years 9 months ago
    A Scalable Parallel Subspace Clustering Algorithm for Massive Data Sets
    Download  cucis.ece.northwestern.edu
    Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
    Harsha S. Nagesh, Sanjay Goil, Alok N. Choudhary
    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.