Sciweavers

    12264 search results - page 16 / 2453
    » Analysis of the rubberband algorithm
    Sort
    View
    CORR
    2010
    Springer
    81views Education» more  CORR 2010»
    Analysis of Agglomerative Clustering
    13 years 2 months ago
    Analysis of Agglomerative Clustering
    Download  ls2-www.cs.uni-dortmund.de
    The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
    Marcel R. Ackermann, Johannes Blömer, Daniel ...
    claim paper
    Read More »
    AICS
    2009
    263views Artificial Intelligence» more  AICS 2009»
    Robustness Analysis of Model-Based Collaborative Filtering Systems
    13 years 5 months ago
    Robustness Analysis of Model-Based Collaborative Filtering Systems
    Download  www.csi.ucd.ie
    Collaborative filtering (CF) recommender systems are very popular and successful in commercial application fields. However, robustness analysis research has shown that conventional...
    Zunping Cheng, Neil Hurley
    claim paper
    Read More »
    STOC
    2001
    ACM
    317views Algorithms» more  STOC 2001»
    Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time
    14 years 7 months ago
    Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time
    Download  page.mi.fu-berlin.de
    Daniel A. Spielman, Shang-Hua Teng
    claim paper
    Read More »
    JGAA
    2007
    135views more  JGAA 2007»
    Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
    13 years 7 months ago
    Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
    Download  www.emis.de
    Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
    Donatello Conte, Pasquale Foggia, Mario Vento
    claim paper
    Read More »
    JCST
    2010
    189views more  JCST 2010»
    Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
    13 years 2 months ago
    Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
    Download  hvg.ece.concordia.ca
    Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
    Osman Hasan, Sofiène Tahar
    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.