Sciweavers

    3694 search results - page 102 / 739
    » Stochastic complexity in learning
    Sort
    View
    TCS
    1998
    103views Theoretical Computer Science» more  TCS 1998»
    Sample Size Lower Bounds in PAC Learning by Algorithmic Complexity Theory
    13 years 9 months ago
    Sample Size Lower Bounds in PAC Learning by Algorithmic Complexity Theory
    Download  www.dicom.uninsubria.it
    Bruno Apolloni, Claudio Gentile
    claim paper
    Read More »
    TKDD
    2010
    99views more  TKDD 2010»
    SCOAL: A framework for simultaneous co-clustering and learning from complex data
    13 years 8 months ago
    SCOAL: A framework for simultaneous co-clustering and learning from complex data
    Download  ideal.ece.utexas.edu
    Meghana Deodhar, Joydeep Ghosh
    claim paper
    Read More »
    AI
    2010
    Springer
    157views Artificial Intelligence» more  AI 2010»
    Learning complex action models with quantifiers and logical implications
    13 years 8 months ago
    Learning complex action models with quantifiers and logical implications
    Download  www.zsusoft.com
    Hankz Hankui Zhuo, Qiang Yang, Derek Hao Hu, Lei L...
    claim paper
    Read More »
    CORR
    2010
    Springer
    101views Education» more  CORR 2010»
    Online Learning: Random Averages, Combinatorial Parameters, and Learnability
    13 years 9 months ago
    Online Learning: Random Averages, Combinatorial Parameters, and Learnability
    Download  www.cs.utexas.edu
    We develop a theory of online learning by defining several complexity measures. Among them are analogues of Rademacher complexity, covering numbers and fatshattering dimension fro...
    Alexander Rakhlin, Karthik Sridharan, Ambuj Tewari
    claim paper
    Read More »
    STOC
    2009
    ACM
    120views Algorithms» more  STOC 2009»
    A constant-factor approximation for stochastic Steiner forest
    14 years 10 months ago
    A constant-factor approximation for stochastic Steiner forest
    Download  www.cse.iitd.ernet.in
    We consider the stochastic Steiner forest problem: suppose we were given a collection of Steiner forest instances, and were guaranteed that a random one of these instances would a...
    Anupam Gupta, Amit Kumar
    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.