Sciweavers

    540 search results - page 85 / 108
    » New bounds on the edge number of a k-map graph
    Sort
    View
    POPL
    1996
    ACM
    95views Programming Languages» more  POPL 1996»
    A Provably Time-Efficient Parallel Implementation of Full Speculation
    14 years 28 days ago
    A Provably Time-Efficient Parallel Implementation of Full Speculation
    Download  www.cs.cmu.edu
    that defines abstract costs for measuring or analyzing the performance of computations, (2) to supply the users with a mapping of these costs onto runtimes on various machine model...
    John Greiner, Guy E. Blelloch
    claim paper
    Read More »
    JEC
    2006
    61views more  JEC 2006»
    Time-constrained loop scheduling with minimal resources
    13 years 8 months ago
    Time-constrained loop scheduling with minimal resources
    Download  www.utdallas.edu
    Many applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). In our previous work, we proposed a ...
    Timothy W. O'Neil, Edwin Hsing-Mean Sha
    claim paper
    Read More »
    PKDD
    2009
    Springer
    124views Data Mining» more  PKDD 2009»
    Capacity Control for Partially Ordered Feature Sets
    14 years 3 months ago
    Capacity Control for Partially Ordered Feature Sets
    Download  www.eecs.berkeley.edu
    Abstract. Partially ordered feature sets appear naturally in many classification settings with structured input instances, for example, when the data instances are graphs and a fe...
    Ulrich Rückert
    claim paper
    Read More »
    PAMI
    2002
    184views more  PAMI 2002»
    Identifying Faces in a 2D Line Drawing Representing a Manifold Object
    13 years 8 months ago
    Identifying Faces in a 2D Line Drawing Representing a Manifold Object
    Download  mmlab.ie.cuhk.edu.hk
    A straightforward way to illustrate a 3D model is to use a line drawing. Faces in a 2D line drawing provide important information for reconstructing its 3D geometry. Manifold objec...
    Jianzhuang Liu, Yong Tsui Lee, Wai-kuen Cham
    claim paper
    Read More »
    COMBINATORICS
    1999
    90views more  COMBINATORICS 1999»
    On the Theory of Pfaffian Orientations. II. T-joins, k-cuts, and Duality of Enumeration
    13 years 8 months ago
    On the Theory of Pfaffian Orientations. II. T-joins, k-cuts, and Duality of Enumeration
    Download  www.combinatorics.org
    This is a continuation of our paper "A Theory of Pfaffian Orientations I: Perfect Matchings and Permanents". We present a new combinatorial way to compute the generating...
    Anna Galluccio, Martin Loebl
    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.