Sciweavers

    139 search results - page 27 / 28
    » Numerical error analysis in Zernike moments computation
    Sort
    View
    88
    Voted
    FTRTFT
    1998
    Springer
    112views Formal Methods» more  FTRTFT 1998»
    On the Need for Practical Formal Methods
    15 years 2 months ago
    On the Need for Practical Formal Methods
    Download  chacs.nrl.navy.mil
    A controversial issue in the formal methods community is the degree to which mathematical sophistication and theorem proving skills should be needed to apply a formal method. A fun...
    Constance L. Heitmeyer
    claim paper
    Read More »
    88
    Voted
    SDM
    2010
    SIAM
    204views Data Mining» more  SDM 2010»
    Scalable Tensor Factorizations with Missing Data
    14 years 11 months ago
    Scalable Tensor Factorizations with Missing Data
    Download  csmr.ca.sandia.gov
    The problem of missing data is ubiquitous in domains such as biomedical signal processing, network traffic analysis, bibliometrics, social network analysis, chemometrics, computer...
    Evrim Acar, Daniel M. Dunlavy, Tamara G. Kolda, Mo...
    claim paper
    Read More »
    VRST
    2003
    ACM
    124views Virtual Reality» more  VRST 2003»
    Time-critical collision detection using an average-case approach
    15 years 3 months ago
    Time-critical collision detection using an average-case approach
    Download  zach.in.tu-clausthal.de
    We present a novel, generic framework and algorithm for hierarchical collision detection, which allows an application to balance speed and quality of the collision detection. We p...
    Jan Klein, Gabriel Zachmann
    claim paper
    Read More »
    95
    Voted
    PPSC
    1993
    90views Distributed And Parallel Com...» more  PPSC 1993»
    Design of a Parallel Nonsymmetric Eigenroutine Toolbox, Part I
    14 years 11 months ago
    Design of a Parallel Nonsymmetric Eigenroutine Toolbox, Part I
    Download  www.eecs.berkeley.edu
    The dense nonsymmetric eigenproblem is one of the hardest linear algebra problems to solvee ectively on massivelyparallel machines. Rather than trying to design a black box" ...
    Zhaojun Bai, James Demmel
    claim paper
    Read More »
    81
    Voted
    QEST
    2008
    IEEE
    145views Modeling and Simulation» more  QEST 2008»
    Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems
    15 years 4 months ago
    Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems
    Download  www.era.lib.ed.ac.uk
    We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
    Kousha Etessami, Dominik Wojtczak, Mihalis Yannaka...
    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.