Sciweavers

    2414 search results - page 398 / 483
    » Computing Normal Subgroups
    Sort
    View
    CAL
    2007
    87views Software Engineering» more  CAL 2007»
    Low-Cost Microarchitectural Support for Improved Floating-Point Accuracy
    13 years 9 months ago
    Low-Cost Microarchitectural Support for Improved Floating-Point Accuracy
    Download  www.engr.uky.edu
    Abstract—Some processors designed for consumer applications, such as Graphics Processing Units (GPUs) and the CELL processor, promise outstanding floating-point performance for ...
    William R. Dieter, A. Kaveti, Henry G. Dietz
    claim paper
    Read More »
    IJAR
    2006
    98views more  IJAR 2006»
    Inference in hybrid Bayesian networks with mixtures of truncated exponentials
    13 years 9 months ago
    Inference in hybrid Bayesian networks with mixtures of truncated exponentials
    Download  web.ku.edu
    Mixtures of truncated exponentials (MTE) potentials are an alternative to discretization for solving hybrid Bayesian networks. Any probability density function can be approximated...
    Barry R. Cobb, Prakash P. Shenoy
    claim paper
    Read More »
    JCIT
    2008
    172views more  JCIT 2008»
    Rough Wavelet Hybrid Image Classification Scheme
    13 years 9 months ago
    Rough Wavelet Hybrid Image Classification Scheme
    Download  www.aicit.org
    This paper introduces a new computer-aided classification system for detection of prostate cancer in Transrectal Ultrasound images (TRUS). To increase the efficiency of the comput...
    Hala S. Own, Aboul Ella Hassanien
    claim paper
    Read More »
    JMLR
    2006
    124views more  JMLR 2006»
    Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problem
    13 years 9 months ago
    Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problem
    Download  ppw.kuleuven.be
    The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
    Tijl De Bie, Nello Cristianini
    claim paper
    Read More »
    JMLR
    2006
    118views more  JMLR 2006»
    Learning Factor Graphs in Polynomial Time and Sample Complexity
    13 years 9 months ago
    Learning Factor Graphs in Polynomial Time and Sample Complexity
    Download  jmlr.csail.mit.edu
    We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...
    Pieter Abbeel, Daphne Koller, Andrew Y. Ng
    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.