Sciweavers

    526 search results - page 67 / 106
    » Increments of Random Partitions
    Sort
    View
    DICTA
    2007
    286views Applied Computing» more  DICTA 2007»
    An in Depth Comparison of Four Texture Segmentation Methods
    13 years 10 months ago
    An in Depth Comparison of Four Texture Segmentation Methods
    Download  eprints.qut.edu.au
    Texture segmentation is the process of partitioning an image into regions with different textures containing similar group of pixels. This paper presents a comparative study of fo...
    Vamsi Krishna Madasu, Prasad K. D. V. Yarlagadda
    claim paper
    Read More »
    VCIP
    2003
    140views Communications» more  VCIP 2003»
    Error-resilient performance evaluation of MPEG-4 and H.264
    13 years 9 months ago
    Error-resilient performance evaluation of MPEG-4 and H.264
    Download  media.skku.ac.kr
    Recent advances in video coding technology have resulted in rapid growth of application in mobile communication. With this explosive growth, reliable transmission and error resili...
    Bongsoo Jung, Younghooi Hwang, Byeungwoo Jeon, Myu...
    claim paper
    Read More »
    COMGEO
    2010
    ACM
    141views Applied Computing» more  COMGEO 2010»
    Approximate centerpoints with proofs
    13 years 8 months ago
    Approximate centerpoints with proofs
    Download  www.cs.cmu.edu
    We present the IteratedTverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S Rd with running time subexponential in d. The alg...
    Gary L. Miller, Donald Sheehy
    claim paper
    Read More »
    CORR
    2008
    Springer
    74views Education» more  CORR 2008»
    Analysis of the Karmarkar-Karp Differencing Algorithm
    13 years 8 months ago
    Analysis of the Karmarkar-Karp Differencing Algorithm
    Download  www.santafe.edu
    The Karmarkar-Karp differencing algorithm is the best known polynomial time heuristic for the number partitioning problem, fundamental in both theoretical computer science and stat...
    Stefan Boettcher, Stephan Mertens
    claim paper
    Read More »
    EOR
    2010
    110views more  EOR 2010»
    A hybrid metaheuristic approach to solving the UBQP problem
    13 years 8 months ago
    A hybrid metaheuristic approach to solving the UBQP problem
    Download  leeds-faculty.colorado.edu
    This paper presents a hybrid metaheuristic approach (HMA) for solving the Unconstrained Binary Quadratic Programming (UBQP) problem. By incorporating a tabu search procedure into ...
    Zhipeng Lü, Fred Glover, Jin-Kao Hao
    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.