Sciweavers

    5606 search results - page 1074 / 1122
    » Randomization Techniques for Graphs.
    Sort
    View
    NIPS
    2008
    285views Information Technology» more  NIPS 2008»
    Natural Image Denoising with Convolutional Networks
    14 years 11 months ago
    Natural Image Denoising with Convolutional Networks
    Download  hebb.mit.edu
    We present an approach to low-level vision that combines two main ideas: the use of convolutional networks as an image processing architecture and an unsupervised learning procedu...
    Viren Jain, H. Sebastian Seung
    claim paper
    Read More »
    SDM
    2008
    SIAM
    177views Data Mining» more  SDM 2008»
    Practical Private Computation and Zero-Knowledge Tools for Privacy-Preserving Distributed Data Mining
    14 years 11 months ago
    Practical Private Computation and Zero-Knowledge Tools for Privacy-Preserving Distributed Data Mining
    Download  www.cs.berkeley.edu
    In this paper we explore private computation built on vector addition and its applications in privacypreserving data mining. Vector addition is a surprisingly general tool for imp...
    Yitao Duan, John F. Canny
    claim paper
    Read More »
    MEDINFO
    2007
    132views Healthcare» more  MEDINFO 2007»
    Comparing Decision Support Methodologies for Identifying Asthma Exacerbations
    14 years 11 months ago
    Comparing Decision Support Methodologies for Identifying Asthma Exacerbations
    Download  www.cs.mtu.edu
    Objective: To apply and compare common machine learning techniques with an expert-built Bayesian Network to determine eligibility for asthma guidelines in pediatric emergency depa...
    Judith W. Dexheimer, Laura E. Brown, Jeffrey Leego...
    claim paper
    Read More »
    SODA
    2008
    ACM
    100views Algorithms» more  SODA 2008»
    A tight lower bound for parity in noisy communication networks
    14 years 11 months ago
    A tight lower bound for parity in noisy communication networks
    Download  www.tcs.tifr.res.in
    We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
    Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Ja...
    claim paper
    Read More »
    AAAI
    2006
    103views Intelligent Agents» more  AAAI 2006»
    Model Counting: A New Strategy for Obtaining Good Bounds
    14 years 11 months ago
    Model Counting: A New Strategy for Obtaining Good Bounds
    Download  www.cs.ubc.ca
    Model counting is the classical problem of computing the number of solutions of a given propositional formula. It vastly generalizes the NP-complete problem of propositional satis...
    Carla P. Gomes, Ashish Sabharwal, Bart Selman
    claim paper
    Read More »
    « Prev « First page 1074 / 1122 Last » Next »
    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.