Sciweavers

    2219 search results - page 71 / 444
    » Dynamic Programming and Graph Algorithms in Computer Vision
    Sort
    View
    IPSN
    2005
    Springer
    144views Sensor Networks» more  IPSN 2005»
    Robust computation of aggregates in wireless sensor networks: distributed randomized algorithms and analysis
    14 years 3 months ago
    Robust computation of aggregates in wireless sensor networks: distributed randomized algorithms and analysis
    Download  www.ee.ndhu.edu.tw
    A wireless sensor network consists of a large number of small, resource-constrained devices and usually operates in hostile environments that are prone to link and node failures. ...
    Jen-Yeu Chen, Gopal Pandurangan, Dongyan Xu
    claim paper
    Read More »
    ICS
    1993
    Tsinghua U.
    173views Distributed And Parallel Com...» more  ICS 1993»
    Graph Contraction for Physical Optimization Methods: A Quality-Cost Tradeoff for Mapping Data on Parallel Computers
    14 years 2 months ago
    Graph Contraction for Physical Optimization Methods: A Quality-Cost Tradeoff for Mapping Data on Parallel Computers
    Download  charm.cs.uiuc.edu
    Mapping data to parallel computers aims at minimizing the execution time of the associated application. However, it can take an unacceptable amount of time in comparison with the ...
    Nashat Mansour, Ravi Ponnusamy, Alok N. Choudhary,...
    claim paper
    Read More »
    TSE
    2010
    151views more  TSE 2010»
    The Probabilistic Program Dependence Graph and Its Application to Fault Diagnosis
    13 years 8 months ago
    The Probabilistic Program Dependence Graph and Its Application to Fault Diagnosis
    Download  pleuma.cc.gatech.edu
    This paper presents an innovative model of a program’s internal behavior over a set of test inputs, called the probabilistic program dependence graph (PPDG), that facilitates pr...
    George K. Baah, Andy Podgurski, Mary Jean Harrold
    claim paper
    Read More »
    IPPS
    1998
    IEEE
    105views Distributed And Parallel Com...» more  IPPS 1998»
    Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems
    14 years 2 months ago
    Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems
    Download  ipdps.cc.gatech.edu
    Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
    Peter R. Cappello, Ömer Egecioglu
    claim paper
    Read More »
    EACL
    2009
    ACL Anthology
    108views Natural Language Processing» more  EACL 2009»
    Cube Summing, Approximate Inference with Non-Local Features, and Dynamic Programming without Semirings
    14 years 10 months ago
    Cube Summing, Approximate Inference with Non-Local Features, and Dynamic Programming without Semirings
    Download  www.cs.cmu.edu
    We introduce cube summing, a technique that permits dynamic programming algorithms for summing over structures (like the forward and inside algorithms) to be extended with non-loc...
    Kevin Gimpel, Noah A. Smith
    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.