Sciweavers

    2 search results - page 1 / 1
    » k-means requires exponentially many iterations even in the p...
    Sort
    View
    COMPGEOM
    2009
    ACM
    100views Discrete Geometry» more  COMPGEOM 2009»
    k-means requires exponentially many iterations even in the plane
    13 years 9 months ago
    k-means requires exponentially many iterations even in the plane
    Download  cseweb.ucsd.edu
    The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
    Andrea Vattani
    claim paper
    Read More »
    QEST
    2008
    IEEE
    145views Modeling and Simulation» more  QEST 2008»
    Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems
    13 years 11 months ago
    Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems
    Download  www.era.lib.ed.ac.uk
    We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
    Kousha Etessami, Dominik Wojtczak, Mihalis Yannaka...
    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.