Sciweavers

    94 search results - page 18 / 19
    » Genericity, Randomness, and Polynomial-Time Approximations
    Sort
    View
    STOC
    2007
    ACM
    112views Algorithms» more  STOC 2007»
    Smooth sensitivity and sampling in private data analysis
    14 years 8 months ago
    Smooth sensitivity and sampling in private data analysis
    Download  people.csail.mit.edu
    We introduce a new, generic framework for private data analysis. The goal of private data analysis is to release aggregate information about a data set while protecting the privac...
    Kobbi Nissim, Sofya Raskhodnikova, Adam Smith
    claim paper
    Read More »
    GLOBECOM
    2007
    IEEE
    125views Communications» more  GLOBECOM 2007»
    On the Expected Connection Lifetime and Stochastic Resilience of Wireless Multi-Hop Networks
    14 years 1 months ago
    On the Expected Connection Lifetime and Stochastic Resilience of Wireless Multi-Hop Networks
    Download  www.ece.ncsu.edu
    —To understand how node mobility and Byzantine node failures affect connectivity of wireless multi-hop networks, this paper investigates resilience of geometric random graphs to ...
    Fei Xing, Wenye Wang
    claim paper
    Read More »
    ICDCS
    2007
    IEEE
    86views Distributed And Parallel Com...» more  ICDCS 2007»
    Distributed Slicing in Dynamic Systems
    14 years 1 months ago
    Distributed Slicing in Dynamic Systems
    Download  lsd.ls.fi.upm.es
    Peer to peer (P2P) systems are moving from application specific architectures to a generic service oriented design philosophy. This raises interesting problems in connection with...
    Antonio Fernández, Vincent Gramoli, Ernesto...
    claim paper
    Read More »
    SSDBM
    2003
    IEEE
    96views Database» more  SSDBM 2003»
    Space Constrained Selection Problems for Data Warehouses and Pervasive Computing
    14 years 26 days ago
    Space Constrained Selection Problems for Data Warehouses and Pervasive Computing
    Download  dit.unitn.it
    Space constrained optimization problems arise in a multitude of important applications such as data warehouses and pervasive computing. A typical instance of such problems is to s...
    Themistoklis Palpanas, Nick Koudas, Alberto O. Men...
    claim paper
    Read More »
    STOC
    2009
    ACM
    171views Algorithms» more  STOC 2009»
    On the geometry of graphs with a forbidden minor
    14 years 8 months ago
    On the geometry of graphs with a forbidden minor
    Download  people.csail.mit.edu
    We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
    James R. Lee, Anastasios Sidiropoulos
    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.