Sciweavers

    167 search results - page 16 / 34
    » Convergence rate and termination of asynchronous iterative a...
    Sort
    View
    COLT
    2005
    Springer
    106views Machine Learning» more  COLT 2005»
    General Polynomial Time Decomposition Algorithms
    14 years 1 months ago
    General Polynomial Time Decomposition Algorithms
    Download  www.ruhr-uni-bochum.de
    We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
    Nikolas List, Hans-Ulrich Simon
    claim paper
    Read More »
    PC
    2002
    118views Management» more  PC 2002»
    Parallel algorithms for indefinite linear systems
    13 years 7 months ago
    Parallel algorithms for indefinite linear systems
    Download  faculty.cs.tamu.edu
    Saddle-point problems give rise to indefinite linear systems that are challenging to solve via iterative methods. This paper surveys two recent techniques for solving such problem...
    Ahmed H. Sameh, Vivek Sarin
    claim paper
    Read More »
    ICC
    2008
    IEEE
    142views Communications» more  ICC 2008»
    Contention Window and Transmission Opportunity Adaptation for Dense IEEE 802.11 WLAN Based on Loss Differentiation
    14 years 2 months ago
    Contention Window and Transmission Opportunity Adaptation for Dense IEEE 802.11 WLAN Based on Loss Differentiation
    Download  www.ee.washington.edu
    — In high density (HD) WLANs, packet losses can occur due to hidden terminals (asynchronous interference) or collisions (synchronous interference). Without differentiating above ...
    Hui Ma, Sumit Roy
    claim paper
    Read More »
    TSP
    2010
    175views Artificial Intelligence» more  TSP 2010»
    Optimization and analysis of distributed averaging with short node memory
    13 years 2 months ago
    Optimization and analysis of distributed averaging with short node memory
    Download  www.tsp.ece.mcgill.ca
    Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...
    Boris N. Oreshkin, Mark Coates, Michael G. Rabbat
    claim paper
    Read More »
    ICML
    2008
    IEEE
    195views Machine Learning» more  ICML 2008»
    Estimating local optimums in EM algorithm over Gaussian mixture model
    14 years 8 months ago
    Estimating local optimums in EM algorithm over Gaussian mixture model
    Download  www.comp.nus.edu.sg
    EM algorithm is a very popular iteration-based method to estimate the parameters of Gaussian Mixture Model from a large observation set. However, in most cases, EM algorithm is no...
    Zhenjie Zhang, Bing Tian Dai, Anthony K. H. Tung
    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.