Sciweavers

    SIAMJO
    2008
    100views more  SIAMJO 2008»
    On the Global Solution of Linear Programs with Linear Complementarity Constraints
    13 years 9 months ago
    On the Global Solution of Linear Programs with Linear Complementarity Constraints
    Download  www.rpi.edu
    This paper presents a parameter-free integer-programming based algorithm for the global resolution of a linear program with linear complementarity constraints (LPCC). The cornersto...
    Jing Hu, John E. Mitchell, Jong-Shi Pang, Kristin ...
    claim paper
    Read More »
    SIAMIS
    2008
    279views more  SIAMIS 2008»
    A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
    13 years 9 months ago
    A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
    Download  www.caam.rice.edu
    We propose, analyze and test an alternating minimization algorithm for recovering images from blurry and noisy observations with total variation (TV) regularization. This algorith...
    Yilun Wang, Junfeng Yang, Wotao Yin, Yin Zhang
    claim paper
    Read More »
    PRL
    2006
    124views more  PRL 2006»
    Parameter selection for suppressed fuzzy c-means with an application to MRI segmentation
    13 years 9 months ago
    Parameter selection for suppressed fuzzy c-means with an application to MRI segmentation
    Download  www2.math.cycu.edu.tw
    This paper presents an algorithm, called the modified suppressed fuzzy c-means (MS-FCM), that simultaneously performs clustering and parameter selection for the suppressed fuzzy c...
    Wen-Liang Hung, Miin-Shen Yang, De-Hua Chen
    claim paper
    Read More »
    SIAMDM
    2008
    61views more  SIAMDM 2008»
    Unit Circular-Arc Graph Representations and Feasible Circulations
    13 years 9 months ago
    Unit Circular-Arc Graph Representations and Feasible Circulations
    Download  www-2.dc.uba.ar
    In a recent paper, Dur
    Min Chih Lin, Jayme Luiz Szwarcfiter
    claim paper
    Read More »
    SIAMDM
    2008
    148views more  SIAMDM 2008»
    A New Algorithm for On-line Coloring Bipartite Graphs
    13 years 9 months ago
    A New Algorithm for On-line Coloring Bipartite Graphs
    Download  www.dur.ac.uk
    We first show that for any bipartite graph H with at most five vertices, there exists an on-line competitive algorithm for the class of H-free bipartite graphs. We then analyze th...
    Hajo Broersma, Agostino Capponi, Daniël Paulu...
    claim paper
    Read More »
    SIAMCOMP
    2008
    121views more  SIAMCOMP 2008»
    Closest Substring Problems with Small Distances
    13 years 9 months ago
    Closest Substring Problems with Small Distances
    Download  www.cs.bme.hu
    We study two pattern matching problems that are motivated by applications in computational biology. In the Closest Substring problem k strings s1, . . ., sk are given, and the tas...
    Dániel Marx
    claim paper
    Read More »
    SIAMCOMP
    2008
    124views more  SIAMCOMP 2008»
    A Faster, Better Approximation Algorithm for the Minimum Latency Problem
    13 years 9 months ago
    A Faster, Better Approximation Algorithm for the Minimum Latency Problem
    Download  pluto.huji.ac.il
    We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
    Aaron Archer, Asaf Levin, David P. Williamson
    claim paper
    Read More »
    IJAC
    2007
    59views more  IJAC 2007»
    Polynomial-Time Complexity for Instances of the Endomorphism Problem in Free Groups
    13 years 9 months ago
    Polynomial-Time Complexity for Instances of the Endomorphism Problem in Free Groups
    Download  www.crm.es
    Abstract. We say the endomorphism problem is solvable for an element W in a free group F if it can be decided effectively whether, given U in F , there is an endomorphism φ of F ...
    Laura Ciobanu
    claim paper
    Read More »
    SIAMCOMP
    2008
    140views more  SIAMCOMP 2008»
    The Forgetron: A Kernel-Based Perceptron on a Budget
    13 years 9 months ago
    The Forgetron: A Kernel-Based Perceptron on a Budget
    Download  ttic.uchicago.edu
    Abstract. The Perceptron algorithm, despite its simplicity, often performs well in online classification tasks. The Perceptron becomes especially effective when it is used in conju...
    Ofer Dekel, Shai Shalev-Shwartz, Yoram Singer
    claim paper
    Read More »
    IJAC
    2007
    59views more  IJAC 2007»
    Automorphic Equivalence Problem for Free Associative Algebras of Rank Two
    13 years 9 months ago
    Automorphic Equivalence Problem for Free Associative Algebras of Rank Two
    Download  hkumath.hku.hk
    Let K x, y be the free associative algebra of rank 2 over an algebraically closed constructive field of any characteristic. We present an algorithm which decides whether or not tw...
    Vesselin Drensky, Jie-Tai Yu
    claim paper
    Read More »
    « first‹ previous…858687888990919293…next ›last »
    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.