Sciweavers

    1149 search results - page 8 / 230
    » Minimally non-Pfaffian graphs
    Sort
    View
    WEA
    2005
    Springer
    138views Algorithms» more  WEA 2005»
    A Practical Minimal Perfect Hashing Method
    15 years 11 months ago
    A Practical Minimal Perfect Hashing Method
    Download  cmph.sourceforge.net
    We propose a novel algorithm based on random graphs to construct minimal perfect hash functions h. For a set of n keys, our algorithm outputs h in expected time O(n). The evaluatio...
    Fabiano C. Botelho, Yoshiharu Kohayakawa, Nivio Zi...
    claim paper
    Read More »
    DATE
    2009
    IEEE
    120views Hardware» more  DATE 2009»
    Optimizing data flow graphs to minimize hardware implementation
    16 years 23 days ago
    Optimizing data flow graphs to minimize hardware implementation
    Download  www.ecs.umass.edu
    Abstract - This paper describes an efficient graphbased method to optimize data-flow expressions for best hardware implementation. The method is based on factorization, common su...
    Daniel Gomez-Prado, Q. Ren, Maciej J. Ciesielski, ...
    claim paper
    Read More »
    ASPDAC
    2009
    ACM
    80views Hardware» more  ASPDAC 2009»
    Improving scalability of model-checking for minimizing buffer requirements of synchronous dataflow graphs
    16 years 15 days ago
    Improving scalability of model-checking for minimizing buffer requirements of synchronous dataflow graphs
    Download  user.it.uu.se
    Nan Guan, Zonghua Gu, Wang Yi, Ge Yu
    claim paper
    Read More »
    SCALESPACE
    2007
    Springer
    150views Computer Vision» more  SCALESPACE 2007»
    Total Variation Minimization and Graph Cuts for Moving Objects Segmentation
    16 years 3 days ago
    Total Variation Minimization and Graph Cuts for Moving Objects Segmentation
    Download  hal.archives-ouvertes.fr
    Florent Ranchin, Antonin Chambolle, Françoi...
    claim paper
    Read More »
    ESA
    2004
    Springer
    92views Algorithms» more  ESA 2004»
    Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems
    15 years 11 months ago
    Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems
    Download  rutcor.rutgers.edu
    Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.