Sciweavers

    10608 search results - page 54 / 2122
    » Complexity of O'Hara's Algorithm
    Sort
    View
    ICASSP
    2009
    IEEE
    255views Signal Processing» more  ICASSP 2009»
    Complex NMF: A new sparse representation for acoustic signals
    14 years 4 months ago
    Complex NMF: A new sparse representation for acoustic signals
    Download  www.brl.ntt.co.jp
    This paper presents a new sparse representation for acoustic signals which is based on a mixing model defined in the complex-spectrum domain (where additivity holds), and allows ...
    Hirokazu Kameoka, Nobutaka Ono, Kunio Kashino, Shi...
    claim paper
    Read More »
    STOC
    1993
    ACM
    63views Algorithms» more  STOC 1993»
    Some complexity issues on the simply connected regions of the two-dimensional plane
    14 years 2 months ago
    Some complexity issues on the simply connected regions of the two-dimensional plane
    Download  aleph0.clarku.edu
    d Abstract) Arthur W. Chou1 and Ker-I Ko2 March 9, 1993
    Arthur W. Chou, Ker-I Ko
    claim paper
    Read More »
    JMLR
    2010
    143views more  JMLR 2010»
    Rademacher Complexities and Bounding the Excess Risk in Active Learning
    13 years 4 months ago
    Rademacher Complexities and Bounding the Excess Risk in Active Learning
    Download  fodava.gatech.edu
    Sequential algorithms of active learning based on the estimation of the level sets of the empirical risk are discussed in the paper. Localized Rademacher complexities are used in ...
    Vladimir Koltchinskii
    claim paper
    Read More »
    SIGAL
    1990
    221views Algorithms» more  SIGAL 1990»
    Complexity Cores and Hard Problem Instances
    14 years 2 months ago
    Complexity Cores and Hard Problem Instances
    Download  www.uni-ulm.de
    Many intractable problems such as NP-complete problems (provided P = NP) have easy subproblems. In contrast, we investigate the existence and the properties of inherently hard sub...
    Uwe Schöning
    claim paper
    Read More »
    SSWMC
    2004
    156views Security Privacy» more  SSWMC 2004»
    On the complexity and hardness of the steganography embedding problem
    13 years 11 months ago
    On the complexity and hardness of the steganography embedding problem
    Download  www.ece.stevens-tech.edu
    We analyze the complexity of the steganography problem and show that the decision version of the problem is NP-complete through transformation from the Knapsack problem. We also g...
    Rajarathnam Chandramouli, Shalin P. Trivedi, R. N....
    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.