Sciweavers

    1974 search results - page 271 / 395
    » On Unbiased Linear Approximations
    Sort
    View
    ICAI
    2007
    77views Artificial Intelligence» more  ICAI 2007»
    Dynamic Programming Algorithm for Training Functional Networks
    14 years 11 months ago
    Dynamic Programming Algorithm for Training Functional Networks
    Download  faculty.kfupm.edu.sa
    Abstract— The paper proposes a dynamic programming algorithm for training of functional networks. The algorithm considers each node as a state. The problem is formulated as find...
    Emad A. El-Sebakhy, Salahadin Mohammed, Moustafa E...
    claim paper
    Read More »
    IPCO
    2008
    114views Optimization» more  IPCO 2008»
    The Stochastic Machine Replenishment Problem
    14 years 11 months ago
    The Stochastic Machine Replenishment Problem
    Download  www.cs.duke.edu
    We study the stochastic machine replenishment problem, which is a canonical special case of closed multiclass queuing systems in Markov decision theory. The problem models the sche...
    Kamesh Munagala, Peng Shi
    claim paper
    Read More »
    ICONIP
    2007
    139views Information Technology» more  ICONIP 2007»
    Principal Component Analysis for Sparse High-Dimensional Data
    14 years 11 months ago
    Principal Component Analysis for Sparse High-Dimensional Data
    Download  www.cis.hut.fi
    Abstract. Principal component analysis (PCA) is a widely used technique for data analysis and dimensionality reduction. Eigenvalue decomposition is the standard algorithm for solvi...
    Tapani Raiko, Alexander Ilin, Juha Karhunen
    claim paper
    Read More »
    NIPS
    2008
    150views Information Technology» more  NIPS 2008»
    Fast Rates for Regularized Objectives
    14 years 11 months ago
    Fast Rates for Regularized Objectives
    Download  ttic.uchicago.edu
    We study convergence properties of empirical minimization of a stochastic strongly convex objective, where the stochastic component is linear. We show that the value attained by t...
    Karthik Sridharan, Shai Shalev-Shwartz, Nathan Sre...
    claim paper
    Read More »
    WICON
    2008
    150views Computer Networks» more  WICON 2008»
    On the practical complexity of solving the maximum weighted independent set problem for optimal scheduling in wireless networks
    14 years 11 months ago
    On the practical complexity of solving the maximum weighted independent set problem for optimal scheduling in wireless networks
    Download  udelmodels.eecis.udel.edu
    It is well known that the maximum weighted independent set (MWIS) problem is NP-complete. Moreover, optimal scheduling in wireless networks requires solving a MWIS problem. Conseq...
    Peng Wang, Stephan Bohacek
    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.