Sciweavers

    5329 search results - page 69 / 1066
    » The Weighted Majority Algorithm
    Sort
    View
    FCT
    2007
    Springer
    151views Applied Computing» more  FCT 2007»
    On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time
    13 years 11 months ago
    On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time
    Download  ccc.cs.uni-duesseldorf.de
    We investigate issues regarding two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chris...
    Gábor Erdélyi, Lane A. Hemaspaandra,...
    claim paper
    Read More »
    ICIP
    1997
    IEEE
    106views Image Processing» more  ICIP 1997»
    Zerotree Design for Image Compression: Toward Weighted Universal Zerotree Coding
    14 years 9 months ago
    Zerotree Design for Image Compression: Toward Weighted Universal Zerotree Coding
    Download  authors.library.caltech.edu
    Weconsidertheproblem of optimal, data-dependentzerotree designfor use in weighted universal zerotree codes for image compression.A weighted universalzerotree code (WUZC) is a data...
    Michelle Effros
    claim paper
    Read More »
    DAGM
    1995
    Springer
    83views Image Processing» more  DAGM 1995»
    Learning Weights in Discrimination Functions Using a priori Constraints
    13 years 11 months ago
    Learning Weights in Discrimination Functions Using a priori Constraints
    Download  www.neuroinformatik.ruhr-uni-bochum.de
    We introduce a learning algorithm for the weights in a very common class of discrimination functions usually called weighted average". Di erent submodules are produced by som...
    Norbert Krüger
    claim paper
    Read More »
    COMGEO
    2006
    ACM
    182views Applied Computing» more  COMGEO 2006»
    Computing homotopic shortest paths efficiently
    13 years 7 months ago
    Computing homotopic shortest paths efficiently
    Download  dimacs.rutgers.edu
    Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
    Alon Efrat, Stephen G. Kobourov, Anna Lubiw
    claim paper
    Read More »
    COLING
    2008
    99views Computational Linguistics» more  COLING 2008»
    On the Weak Generative Capacity of Weighted Context-free Grammars
    13 years 9 months ago
    On the Weak Generative Capacity of Weighted Context-free Grammars
    Download  www.aclweb.org
    It is shown how weighted context-free grammars can be used to recognize languages beyond their weak generative capacity by a one-step constant time extension of standard recogniti...
    Anders Søgaard
    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.