Sciweavers

    2520 search results - page 490 / 504
    » The complexity of approximating entropy
    Sort
    View
    CORR
    2008
    Springer
    139views Education» more  CORR 2008»
    Exact two-terminal reliability of some directed networks
    13 years 9 months ago
    Exact two-terminal reliability of some directed networks
    Download  hal.archives-ouvertes.fr
    Abstract-- The calculation of network reliability in a probabilistic context has long been an issue of practical and academic importance. Conventional approaches (determination of ...
    Christian Tanguy
    claim paper
    Read More »
    ENTCS
    2008
    146views more  ENTCS 2008»
    Probabilistic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions
    13 years 9 months ago
    Probabilistic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions
    Download  lanther.co.uk
    istic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions Michael J. A. Smith1 ,2 Laboratory for Foundations of Computer Science University of Edinb...
    Michael J. A. Smith
    claim paper
    Read More »
    BMCBI
    2006
    100views more  BMCBI 2006»
    Towards a better solution to the shortest common supersequence problem: the deposition and reduction algorithm
    13 years 9 months ago
    Towards a better solution to the shortest common supersequence problem: the deposition and reduction algorithm
    Download  www.biomedcentral.com
    Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
    Kang Ning, Hon Wai Leong
    claim paper
    Read More »
    CGF
    2006
    191views more  CGF 2006»
    A Robust Two-Step Procedure for Quad-Dominant Remeshing
    13 years 9 months ago
    A Robust Two-Step Procedure for Quad-Dominant Remeshing
    Download  www-i8.informatik.rwth-aachen.de
    We propose a new technique for quad-dominant remeshing which separates the local regularity requirements from the global alignment requirements by working in two steps. In the fir...
    Martin Marinov, Leif Kobbelt
    claim paper
    Read More »
    COMCOM
    2006
    147views more  COMCOM 2006»
    Coverage-adaptive random sensor scheduling for application-aware data gathering in wireless sensor networks
    13 years 9 months ago
    Coverage-adaptive random sensor scheduling for application-aware data gathering in wireless sensor networks
    Download  www.uoguelph.ca
    Due to the application-specific nature of wireless sensor networks, application-aware algorithm and protocol design paradigms are highly required in order to optimize the overall ...
    Wook Choi, Sajal K. Das
    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.