Sciweavers

    10051 search results - page 97 / 2011
    » A Dynamic Separator Algorithm
    Sort
    View
    MOC
    2011
    238views Intelligent Agents» more  MOC 2011»
    An optimal adaptive mixed finite element method
    14 years 7 months ago
    An optimal adaptive mixed finite element method
    Download  www.matheon.de
    Abstract. Various applications in uid dynamics and computational continuum mechanics motivate the development of reliable and ecient adaptive algorithms for mixed nite element m...
    Carsten Carstensen, Hella Rabus
    claim paper
    Read More »
    104
    Voted
    ENTCS
    2008
    68views more  ENTCS 2008»
    The Reach-and-Evolve Algorithm for Reachability Analysis of Nonlinear Dynamical Systems
    15 years 21 days ago
    The Reach-and-Evolve Algorithm for Reachability Analysis of Nonlinear Dynamical Systems
    Download  www.goldsztejn.com
    This paper introduces a new algorithm dedicated to the rigorous reachability analysis of nonlinear dynamical systems. The algorithm is initially presented in the context of discre...
    Pieter Collins, Alexandre Goldsztejn
    claim paper
    Read More »
    106
    Voted
    ICASSP
    2009
    IEEE
    136views Signal Processing» more  ICASSP 2009»
    A variational EM algorithm for learning eigenvoice parameters in mixed signals
    15 years 7 months ago
    A variational EM algorithm for learning eigenvoice parameters in mixed signals
    Download  www.ee.columbia.edu
    We derive an efficient learning algorithm for model-based source separation for use on single channel speech mixtures where the precise source characteristics are not known a pri...
    Ron J. Weiss, Daniel P. W. Ellis
    claim paper
    Read More »
    98
    Voted
    IJON
    2006
    96views more  IJON 2006»
    Quasi-optimal EASI algorithm based on the Score Function Difference (SFD)
    15 years 19 days ago
    Quasi-optimal EASI algorithm based on the Score Function Difference (SFD)
    Download  sharif.edu
    Equivariant Adaptive Separation via Independence (EASI) is one of the most successful algorithms for Blind Source Separation (BSS). However, the user has to choose nonlinearities,...
    Samareh Samadi, Massoud Babaie-Zadeh, Christian Ju...
    claim paper
    Read More »
    STOC
    2004
    ACM
    73views Algorithms» more  STOC 2004»
    Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus
    16 years 28 days ago
    Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus
    Download  web.mit.edu
    In this paper, we address two longstanding questions about finding good separators in graphs of bounded genus and degree:
    Jonathan A. Kelner
    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.