Sciweavers

    661 search results - page 4 / 133
    » On Distributed Computation in Noisy Random Planar Networks
    Sort
    View
    TMC
    2011
    131views more  TMC 2011»
    In-Network Computation in Random Wireless Networks: A PAC Approach to Constant Refresh Rates with Lower Energy Costs
    13 years 2 months ago
    In-Network Computation in Random Wireless Networks: A PAC Approach to Constant Refresh Rates with Lower Energy Costs
    Download  ece.iisc.ernet.in
    —We propose a method to compute a probably approximately correct (PAC) normalized histogram of observations with a refresh rate of Âð1Þ time units per histogram sample on a ra...
    Srikanth K. Iyer, D. Manjunath, R. Sundaresan
    claim paper
    Read More »
    FOCS
    2008
    IEEE
    110views Theoretical Computer Science» more  FOCS 2008»
    Lower Bounds for Noisy Wireless Networks using Sampling Algorithms
    14 years 1 months ago
    Lower Bounds for Noisy Wireless Networks using Sampling Algorithms
    Download  www.tcs.tifr.res.in
    We show a tight lower bound of Ω(N log log N) on the number of transmissions required to compute several functions (including the parity function and the majority function) in a...
    Chinmoy Dutta, Jaikumar Radhakrishnan
    claim paper
    Read More »
    IPSN
    2005
    Springer
    144views Sensor Networks» more  IPSN 2005»
    Robust computation of aggregates in wireless sensor networks: distributed randomized algorithms and analysis
    14 years 26 days 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 »
    ICASSP
    2008
    IEEE
    181views Signal Processing» more  ICASSP 2008»
    Finding needles in noisy haystacks
    14 years 1 months ago
    Finding needles in noisy haystacks
    Download  www.ee.columbia.edu
    The theory of compressed sensing shows that samples in the form of random projections are optimal for recovering sparse signals in high-dimensional spaces (i.e., finding needles ...
    Rui M. Castro, Jarvis Haupt, Robert Nowak, Gil M. ...
    claim paper
    Read More »
    SPAA
    2006
    ACM
    94views Distributed And Parallel Com...» more  SPAA 2006»
    Distributed random digraph transformations for peer-to-peer networks
    14 years 1 months ago
    Distributed random digraph transformations for peer-to-peer networks
    Download  cone.informatik.uni-freiburg.de
    Peter Mahlmann, Christian Schindelhauer
    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.