Sciweavers

    124 search results - page 4 / 25
    » The Path Length of Binary Trees
    Sort
    View
    CIAC
    2003
    Springer
    101views Algorithms» more  CIAC 2003»
    Optimal Binary Search Trees with Costs Depending on the Access Paths
    14 years 29 days ago
    Optimal Binary Search Trees with Costs Depending on the Access Paths
    Download  www.cwr.cl
    Jayme Luiz Szwarcfiter
    claim paper
    Read More »
    ASPDAC
    2004
    ACM
    107views Hardware» more  ASPDAC 2004»
    Minimization of the expected path length in BDDs based on local changes
    14 years 1 months ago
    Minimization of the expected path length in BDDs based on local changes
    Download  www.informatik.uni-bremen.de
    — In many verification tools methods for functional simulation based on reduced ordered Binary Decision Diagrams (BDDs) are used. The evaluation time for a BDD can be crucial an...
    Rüdiger Ebendt, Wolfgang Günther, Rolf D...
    claim paper
    Read More »
    TCS
    2008
    175views Theoretical Computer Science» more  TCS 2008»
    The cost of offline binary search tree algorithms and the complexity of the request sequence
    13 years 7 months ago
    The cost of offline binary search tree algorithms and the complexity of the request sequence
    Download  www.cs.tut.fi
    In evaluating the performance of online algorithms for search trees, one wants to compare them to the best offline algorithm available. In this paper we lower bound the cost of an...
    Jussi Kujala, Tapio Elomaa
    claim paper
    Read More »
    19
    Voted
    ICIP
    1999
    IEEE
    135views Image Processing» more  ICIP 1999»
    Unsupervised Progressive Parsing of Poisson Fields Using Minimum Description Length, Criteria
    14 years 9 months ago
    Unsupervised Progressive Parsing of Poisson Fields Using Minimum Description Length, Criteria
    Download  www.lx.it.pt
    This paper describes novel methods for estimating piecewise homogeneous Poisson elds based on minimum description length (MDL) criteria. By adopting a coding-theoretic approach, o...
    Mário A. T. Figueiredo, Robert D. Nowak
    claim paper
    Read More »
    AAAI
    2004
    115views Intelligent Agents» more  AAAI 2004»
    Tractable Tree Convex Constraint Networks
    13 years 9 months ago
    Tractable Tree Convex Constraint Networks
    Download  www.aaai.org
    A binary constraint network is tree convex if we can construct a tree for the domain of the variables so that for any constraint, no matter what value one variable takes, all the ...
    Yuanlin Zhang, Eugene C. Freuder
    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.