Sciweavers

    JC
    2002
    49views more  JC 2002»
    The covering number in learning theory
    13 years 11 months ago
    The covering number in learning theory
    Download  web.mit.edu
    Ding-Xuan Zhou
    claim paper
    Read More »
    JC
    2002
    46views more  JC 2002»
    What Is the Complexity of Volume Calculation?
    13 years 11 months ago
    What Is the Complexity of Volume Calculation?
    Download  www.cs.columbia.edu
    Arthur G. Werschulz, Henryk Wozniakowski
    claim paper
    Read More »
    JC
    2002
    37views more  JC 2002»
    A Two-Dimensional Bisection Envelope Algorithm for Fixed Points
    13 years 11 months ago
    A Two-Dimensional Bisection Envelope Algorithm for Fixed Points
    Download  www.csafe.utah.edu
    Spencer D. Shellman, K. Sikorski
    claim paper
    Read More »
    JC
    2002
    32views more  JC 2002»
    On Asymptotically Optimal Methods of Prediction and Adaptive Coding for Markov Sources
    13 years 11 months ago
    On Asymptotically Optimal Methods of Prediction and Adaptive Coding for Markov Sources
    Download  boris.ryabko.net
    Boris Ryabko, Flemming Topsøe
    claim paper
    Read More »
    JC
    2002
    53views more  JC 2002»
    The Brownian Bridge Does Not Offer a Consistent Advantage in Quasi-Monte Carlo Integration
    13 years 11 months ago
    The Brownian Bridge Does Not Offer a Consistent Advantage in Quasi-Monte Carlo Integration
    Download  www1.cs.columbia.edu
    Anargyros Papageorgiou
    claim paper
    Read More »
    JC
    2002
    50views more  JC 2002»
    Verifying Topological Indices for Higher-Order Rank Deficiencies
    13 years 11 months ago
    Verifying Topological Indices for Higher-Order Rank Deficiencies
    Download  interval.louisiana.edu
    It has been known how to use computational fixed point theorems to verify existence and uniqueness of a true solution to a nonlinear system of equations within a small region abou...
    R. Baker Kearfott, Jianwei Dian
    claim paper
    Read More »
    JC
    2002
    37views more  JC 2002»
    A Theory of Complexity for Continuous Time Systems
    13 years 11 months ago
    A Theory of Complexity for Continuous Time Systems
    Download  www.cs.umass.edu
    Asa Ben-Hur, Hava T. Siegelmann, Shmuel Fishman
    claim paper
    Read More »
    JC
    2002
    63views more  JC 2002»
    On the Complexity of Exclusion Algorithms for Optimization
    13 years 11 months ago
    On the Complexity of Exclusion Algorithms for Optimization
    Download  www.math.colostate.edu
    Exclusion algorithms are a well-known tool in the area of interval analysis for finding all solutions of a system of nonlinear equations or for finding the global minimum of a fun...
    Eugene L. Allgower, Melissa Erdmann, Kurt Georg
    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.