Sciweavers

    459 search results - page 29 / 92
    » Approximation Algorithms for Buy-at-Bulk Geometric Network D...
    Sort
    View
    PODS
    2006
    ACM
    134views Database» more  PODS 2006»
    Approximate quantiles and the order of the stream
    14 years 8 months ago
    Approximate quantiles and the order of the stream
    Download  www.cis.upenn.edu
    Recently, there has been an increased focus on modeling uncertainty by distributions. Suppose we wish to compute a function of a stream whose elements are samples drawn independen...
    Sudipto Guha, Andrew McGregor
    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 8 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 »
    ICNP
    2006
    IEEE
    147views Computer Networks» more  ICNP 2006»
    Benefit-based Data Caching in Ad Hoc Networks
    14 years 2 months ago
    Benefit-based Data Caching in Ad Hoc Networks
    Download  www.cs.wichita.edu
    —Data caching can significantly improve the efficiency of information access in a wireless ad hoc network by reducing the access latency and bandwidth usage. However, designing e...
    Bin Tang, Himanshu Gupta, Samir R. Das
    claim paper
    Read More »
    COMPGEOM
    2006
    ACM
    112views Discrete Geometry» more  COMPGEOM 2006»
    Minimum-cost coverage of point sets by disks
    14 years 2 months ago
    Minimum-cost coverage of point sets by disks
    Download  compgeom.cs.uiuc.edu
    We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...
    Helmut Alt, Esther M. Arkin, Hervé Brö...
    claim paper
    Read More »
    DISOPT
    2008
    107views more  DISOPT 2008»
    The k-path tree matroid and its applications to survivable network design
    13 years 8 months ago
    The k-path tree matroid and its applications to survivable network design
    Download  www.ams.sunysb.edu
    We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
    Esther M. Arkin, Refael Hassin
    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.