Sciweavers

    2693 search results - page 5 / 539
    » On Computing Complex Navigation Functions
    Sort
    View
    INFOVIS
    2005
    IEEE
    113views Visualization» more  INFOVIS 2005»
    The Visual Code Navigator: An Interactive Toolset for Source Code Investigation
    14 years 3 months ago
    The Visual Code Navigator: An Interactive Toolset for Source Code Investigation
    Download  www.win.tue.nl
    We present the Visual Code Navigator, a set of three interrelated visual tools that we developed for exploring large source code software projects from three different perspective...
    Gerard Lommerse, Freek Nossin, Lucian Voinea, Alex...
    claim paper
    Read More »
    ASCM
    2007
    Springer
    283views Mathematics» more  ASCM 2007»
    Computing the Minkowski Value of the Exponential Function over a Complex Disk
    14 years 4 months ago
    Computing the Minkowski Value of the Exponential Function over a Complex Disk
    Download  mae.ucdavis.edu
    Hyeong In Choi, Rida T. Farouki, Chang Yong Han, H...
    claim paper
    Read More »
    ECCC
    2006
    82views more  ECCC 2006»
    The Complexity of Depth-3 Circuits Computing Symmetric Boolean Functions
    13 years 9 months ago
    The Complexity of Depth-3 Circuits Computing Symmetric Boolean Functions
    Download  cs.haifa.ac.il
    Guy Wolfovitz
    claim paper
    Read More »
    AAAI
    1997
    133views Intelligent Agents» more  AAAI 1997»
    Incremental Methods for Computing Bounds in Partially Observable Markov Decision Processes
    13 years 11 months ago
    Incremental Methods for Computing Bounds in Partially Observable Markov Decision Processes
    Download  www.cs.pitt.edu
    Partially observable Markov decision processes (POMDPs) allow one to model complex dynamic decision or control problems that include both action outcome uncertainty and imperfect ...
    Milos Hauskrecht
    claim paper
    Read More »
    STOC
    2012
    ACM
    221views Algorithms» more  STOC 2012»
    From query complexity to computational complexity
    12 years 6 days ago
    From query complexity to computational complexity
    Download  theory.stanford.edu
    We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
    Shahar Dobzinski, Jan Vondrák
    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.