Sciweavers

    391 search results - page 3 / 79
    » Comparison-Based Algorithms Are Robust and Randomized Algori...
    Sort
    View
    AAAI
    2011
    164views Intelligent Agents» more  AAAI 2011»
    Pushing the Power of Stochastic Greedy Ordering Schemes for Inference in Graphical Models
    12 years 5 months ago
    Pushing the Power of Stochastic Greedy Ordering Schemes for Inference in Graphical Models
    Download  www.ics.uci.edu
    We study iterative randomized greedy algorithms for generating (elimination) orderings with small induced width and state space size - two parameters known to bound the complexity...
    Kalev Kask, Andrew Gelfand, Lars Otten, Rina Decht...
    claim paper
    Read More »
    IPSN
    2005
    Springer
    144views Sensor Networks» more  IPSN 2005»
    Robust computation of aggregates in wireless sensor networks: distributed randomized algorithms and analysis
    13 years 11 months ago
    Robust computation of aggregates in wireless sensor networks: distributed randomized algorithms and analysis
    Download  www.ee.ndhu.edu.tw
    A wireless sensor network consists of a large number of small, resource-constrained devices and usually operates in hostile environments that are prone to link and node failures. ...
    Jen-Yeu Chen, Gopal Pandurangan, Dongyan Xu
    claim paper
    Read More »
    FOCS
    1999
    IEEE
    165views Theoretical Computer Science» more  FOCS 1999»
    An Algorithmic Theory of Learning: Robust Concepts and Random Projection
    13 years 10 months ago
    An Algorithmic Theory of Learning: Robust Concepts and Random Projection
    Download  www-math.mit.edu
    We study the phenomenon of cognitive learning from an algorithmic standpoint. How does the brain effectively learn concepts from a small number of examples despite the fact that e...
    Rosa I. Arriaga, Santosh Vempala
    claim paper
    Read More »
    JDA
    2008
    85views more  JDA 2008»
    A robust randomized algorithm to perform independent tasks
    13 years 5 months ago
    A robust randomized algorithm to perform independent tasks
    Download  carbon.ucdenver.edu
    The Do-All problem is about scheduling t similar and independent tasks to be performed by p processors prone to crashes. We assume that the distributed system is synchronous with ...
    Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Ko...
    claim paper
    Read More »
    TC
    2002
    63views Information Technology» more  TC 2002»
    Randomized Algorithms: A System-Level, Poly-Time Analysis of Robust Computation
    13 years 5 months ago
    Randomized Algorithms: A System-Level, Poly-Time Analysis of Robust Computation
    Download  home.dei.polimi.it
    Cesare Alippi
    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.