Sciweavers

    867 search results - page 27 / 174
    » The Generalized Maximum Coverage Problem
    Sort
    View
    ICIP
    2005
    IEEE
    112views Image Processing» more  ICIP 2005»
    Generalized Wiener estimation algorithms based on a family of heavy-tail distributions
    14 years 9 months ago
    Generalized Wiener estimation algorithms based on a family of heavy-tail distributions
    Download  www.ee.latrobe.edu.au
    A fundamental problem in signal processing is to estimate signal from noisy observations. When some prior information about the statistical models of the signal and noise is avail...
    Guang Deng
    claim paper
    Read More »
    HYBRID
    2009
    Springer
    204views Control Systems» more  HYBRID 2009»
    Convergence of Distributed WSN Algorithms: The Wake-Up Scattering Problem
    14 years 3 months ago
    Convergence of Distributed WSN Algorithms: The Wake-Up Scattering Problem
    Download  www.dit.unitn.it
    In this paper, we analyze the problem of finding a periodic schedule for the wake-up times of a set of nodes in a Wireless Sensor Network that optimizes the coverage of the region...
    Daniele Fontanelli, Luigi Palopoli, Roberto Passer...
    claim paper
    Read More »
    CGF
    2008
    126views more  CGF 2008»
    Maximum Entropy Coordinates for Arbitrary Polytopes
    13 years 8 months ago
    Maximum Entropy Coordinates for Arbitrary Polytopes
    Download  dilbert.engr.ucdavis.edu
    Barycentric coordinates can be used to express any point inside a triangle as a unique convex combination of the triangle's vertices, and they provide a convenient way to lin...
    K. Hormann, N. Sukumar
    claim paper
    Read More »
    SPAA
    2009
    ACM
    168views Distributed And Parallel Com...» more  SPAA 2009»
    Brief announcement: parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network desi
    14 years 8 months ago
    Brief announcement: parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network desi
    Download  www.public.asu.edu
    Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For scala...
    Melih Onus, Andréa W. Richa
    claim paper
    Read More »
    CCCG
    2006
    87views Computational Geometry» more  CCCG 2006»
    On the Maximum Span of Fixed-Angle Chains
    13 years 9 months ago
    On the Maximum Span of Fixed-Angle Chains
    Download  www.utdallas.edu
    Soss proved that it is NP-hard to find the maximum flat span of a fixed-angle polygonal chain: the largest distance achievable between the endpoints in a planar embedding. These f...
    Nadia Benbernou, Joseph O'Rourke
    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.