Sciweavers

    598 search results - page 16 / 120
    » Approximation Algorithms for the Bottleneck Stretch Factor P...
    Sort
    View
    JUCS
    2007
    137views more  JUCS 2007»
    An Approach to Polygonal Approximation of Digital Curves Based on Discrete Particle Swarm Algorithm
    13 years 7 months ago
    An Approach to Polygonal Approximation of Digital Curves Based on Discrete Particle Swarm Algorithm
    Download  www.jucs.org
    : An approach to polygonal approximation of regular digital curves based on PSO algorithm is presented. In this paper, each particle corresponds to a candidate solution to the poly...
    Fangmin Dong, Renbin Xiao, Yifang Zhong, Yong Liu
    claim paper
    Read More »
    ESA
    2003
    Springer
    140views Algorithms» more  ESA 2003»
    Improved Approximation of the Stable Marriage Problem
    14 years 17 days ago
    Improved Approximation of the Stable Marriage Problem
    Download  www.lab2.kuis.kyoto-u.ac.jp
    The stable marriage problem has recently been studied in its general setting, where both ties and incomplete lists are allowed. It is NP-hard to find a stable matching of maximum ...
    Magnús M. Halldórsson, Kazuo Iwama, ...
    claim paper
    Read More »
    JMLR
    2010
    118views more  JMLR 2010»
    Exploiting Within-Clique Factorizations in Junction-Tree Algorithms
    13 years 2 months ago
    Exploiting Within-Clique Factorizations in Junction-Tree Algorithms
    Download  www.cs.caltech.edu
    It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...
    Julian John McAuley, Tibério S. Caetano
    claim paper
    Read More »
    SIAMMAX
    2010
    224views more  SIAMMAX 2010»
    Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices
    13 years 2 months ago
    Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices
    Download  www.math.purdue.edu
    Abstract. Given a symmetric positive definite matrix A, we compute a structured approximate Cholesky factorization A RT R up to any desired accuracy, where R is an upper triangula...
    Jianlin Xia, Ming Gu
    claim paper
    Read More »
    TKDE
    2012
    270views Formal Methods» more  TKDE 2012»
    Low-Rank Kernel Matrix Factorization for Large-Scale Evolutionary Clustering
    11 years 9 months ago
    Low-Rank Kernel Matrix Factorization for Large-Scale Evolutionary Clustering
    Download  www.cs.wayne.edu
    —Traditional clustering techniques are inapplicable to problems where the relationships between data points evolve over time. Not only is it important for the clustering algorith...
    Lijun Wang, Manjeet Rege, Ming Dong, Yongsheng Din...
    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.