Sciweavers

    7289 search results - page 20 / 1458
    » A Dependent Set Theory
    Sort
    View
    ICML
    2003
    IEEE
    134views Machine Learning» more  ICML 2003»
    The Set Covering Machine with Data-Dependent Half-Spaces
    16 years 17 days ago
    The Set Covering Machine with Data-Dependent Half-Spaces
    Download  www.hpl.hp.com
    We examine the set covering machine when it uses data-dependent half-spaces for its set of features and bound its generalization error in terms of the number of training errors an...
    Mario Marchand, Mohak Shah, John Shawe-Taylor, Mar...
    claim paper
    Read More »
    IJFCS
    2008
    108views more  IJFCS 2008»
    Basic Algorithm for Attribute Implications and Functional Dependencies in Graded Setting
    14 years 11 months ago
    Basic Algorithm for Attribute Implications and Functional Dependencies in Graded Setting
    Download  vychodil.inf.upol.cz
    We present GLinClosure, a graded extension of the well-known LinClosure algorithm. GLinClosure can be used to compute degrees of semantic entailment from sets of fuzzy attribute i...
    Radim Belohlávek, Vilém Vychodil
    claim paper
    Read More »
    ECCV
    2008
    Springer
    223views Computer Vision» more  ECCV 2008»
    Scale-Dependent/Invariant Local 3D Shape Descriptors for Fully Automatic Registration of Multiple Sets of Range Images
    16 years 1 months ago
    Scale-Dependent/Invariant Local 3D Shape Descriptors for Fully Automatic Registration of Multiple Sets of Range Images
    Download  www.cs.drexel.edu
    Abstract. Despite the ubiquitous use of range images in various computer vision applications, little has been investigated about the size variation of the local geometric structure...
    John Novatnack, Ko Nishino
    claim paper
    Read More »
    ICML
    2008
    IEEE
    114views Machine Learning» more  ICML 2008»
    SVM optimization: inverse dependence on training set size
    16 years 17 days ago
    SVM optimization: inverse dependence on training set size
    Download  ttic.uchicago.edu
    We discuss how the runtime of SVM optimization should decrease as the size of the training data increases. We present theoretical and empirical results demonstrating how a simple ...
    Shai Shalev-Shwartz, Nathan Srebro
    claim paper
    Read More »
    54
    Voted
    IAT
    2006
    IEEE
    104views Intelligent Agents» more  IAT 2006»
    Content-Based Clustered P2P Search Model Depending on Set Distance
    15 years 5 months ago
    Content-Based Clustered P2P Search Model Depending on Set Distance
    Download  www.apng.org
    Jing Wang, Shoubao Yang
    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-2025, USA.