Sciweavers

    949 search results - page 118 / 190
    » exact 2008
    Sort
    View
    TIP
    2008
    168views more  TIP 2008»
    A Real-Time Algorithm for the Approximation of Level-Set-Based Curve Evolution
    14 years 10 months ago
    A Real-Time Algorithm for the Approximation of Level-Set-Based Curve Evolution
    Download  www.ann.jussieu.fr
    Abstract--In this paper, we present a complete and practical algorithm for the approximation of level-set-based curve evolution suitable for real-time implementation. In particular...
    Yonggang Shi, William Clement Karl
    claim paper
    Read More »
    80
    Voted
    IVC
    2007
    114views more  IVC 2007»
    Evaluation of a convex relaxation to a quadratic assignment matching approach for relational object views
    14 years 10 months ago
    Evaluation of a convex relaxation to a quadratic assignment matching approach for relational object views
    Download  ipa.iwr.uni-heidelberg.de
    We introduce a convex relaxation approach for the quadratic assignment problem to the field of computer vision. Due to convexity, a favourable property of this approach is the ab...
    Christian Schellewald, Stefan Roth, Christoph Schn...
    claim paper
    Read More »
    TIT
    2008
    90views more  TIT 2008»
    An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels
    14 years 10 months ago
    An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels
    Download  webee.technion.ac.il
    This paper derives an improved sphere-packing (ISP) bound for finite-length error-correcting codes whose transmission takes place over symmetric memoryless channels, and the codes...
    Gil Wiechman, Igal Sason
    claim paper
    Read More »
    103
    Voted
    TIT
    2008
    121views more  TIT 2008»
    Stability Results for Random Sampling of Sparse Trigonometric Polynomials
    14 years 10 months ago
    Stability Results for Random Sampling of Sparse Trigonometric Polynomials
    Download  rauhut.ins.uni-bonn.de
    Recently, it has been observed that a sparse trigonometric polynomial, i.e. having only a small number of non-zero coefficients, can be reconstructed exactly from a small number o...
    Holger Rauhut
    claim paper
    Read More »
    TMI
    2008
    135views more  TMI 2008»
    A Factorization Approach for Cone-Beam Reconstruction on a Circular Short-Scan
    14 years 10 months ago
    A Factorization Approach for Cone-Beam Reconstruction on a Circular Short-Scan
    Download  www5.informatik.uni-erlangen.de
    In this paper, we introduce a new algorithm for 3-D image reconstruction from cone-beam (CB) projections acquired along a partial circular scan. Our algorithm is based on a novel, ...
    Frank Dennerlein, Frédéric Noo, H. S...
    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-2025, USA.