Sciweavers

    4469 search results - page 681 / 894
    » Comparing and Combining Profiles
    Sort
    View
    142
    Voted
    NECO
    2008
    129views more  NECO 2008»
    Sparse Coding via Thresholding and Local Competition in Neural Circuits
    15 years 4 months ago
    Sparse Coding via Thresholding and Local Competition in Neural Circuits
    Download  www.maths.tcd.ie
    While evidence indicates that neural systems may be employing sparse approximations to represent sensed stimuli, the mechanisms underlying this ability are not understood. We desc...
    Christopher J. Rozell, Don H. Johnson, Richard G. ...
    claim paper
    Read More »
    161
    Voted
    ETT
    2007
    99views Education» more  ETT 2007»
    On the design of rate-compatible serially concatenated convolutional codes
    15 years 4 months ago
    On the design of rate-compatible serially concatenated convolutional codes
    Download  www.itr.unisa.edu.au
    A powerful class of rate-compatible serially concatenated convolutional codes (SCCCs) has been proposed based on minimizing analytical upper bounds on the error probability in the ...
    Alexandre Graell i Amat, Fredrik Brännstr&oum...
    claim paper
    Read More »
    NETWORKS
    2008
    223views Computer Networks» more  NETWORKS 2008»
    New dynamic programming algorithms for the resource constrained elementary shortest path problem
    15 years 4 months ago
    New dynamic programming algorithms for the resource constrained elementary shortest path problem
    Download  www.crema.unimi.it
    The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...
    Giovanni Righini, Matteo Salani
    claim paper
    Read More »
    ML
    2006
    ACM
    142views Machine Learning» more  ML 2006»
    The max-min hill-climbing Bayesian network structure learning algorithm
    15 years 4 months ago
    The max-min hill-climbing Bayesian network structure learning algorithm
    Download  www.dsl-lab.org
    We present a new algorithm for Bayesian network structure learning, called Max-Min Hill-Climbing (MMHC). The algorithm combines ideas from local learning, constraint-based, and sea...
    Ioannis Tsamardinos, Laura E. Brown, Constantin F....
    claim paper
    Read More »
    136
    Voted
    MT
    2006
    106views more  MT 2006»
    Example-based machine translation based on tree-string correspondence and statistical generation
    15 years 4 months ago
    Example-based machine translation based on tree-string correspondence and statistical generation
    Download  www.toshiba.com.cn
    Abstract. This paper describes an example-based machine translation (EBMT) method based on tree-string correspondence (TSC) and statistical generation. In this method, the translat...
    Zhan-yi Liu, Haifeng Wang, Hua Wu
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.