Sciweavers

554 search results - page 42 / 111
» Smart Redundancy for Distributed Computation
Sort
View
SIGMOD
2002
ACM
129views Database» more  SIGMOD 2002»
14 years 7 months ago
Dwarf: shrinking the PetaCube
Dwarf is a highly compressed structure for computing, storing, and querying data cubes. Dwarf identifies prefix and suffix structural redundancies and factors them out by coalesci...
Yannis Sismanis, Antonios Deligiannakis, Nick Rous...
P2P
2008
IEEE
137views Communications» more  P2P 2008»
14 years 2 months ago
Hierarchical Codes: How to Make Erasure Codes Attractive for Peer-to-Peer Storage Systems
Redundancy is the basic technique to provide reliability in storage systems consisting of multiple components. A redundancy scheme defines how the redundant data are produced and...
Alessandro Duminuco, Ernst Biersack
PERCOM
2005
ACM
14 years 7 months ago
Energy Efficient Differentiable Coverage Service Protocols for Wireless Sensor Networks
This paper considers the problem of maintaining the coverage degree of a wireless sensor network at an application specific level while keeping the sensing units of only a subset o...
Hasan Çam, Hidayet Ozgur Sanli
APPT
2003
Springer
14 years 25 days ago
Improving Availability of P2P Storage Systems
This paper discusses how to building high available storage systems on top of peer-to-peer infrastructure. We first demonstrate that traditional definitions of availability are not...
Shuming Shi, Guangwen Yang, Jin Yu, Yongwei Wu, Di...
ICDM
2007
IEEE
101views Data Mining» more  ICDM 2007»
14 years 1 months ago
Lightweight Distributed Trust Propagation
Using mobile devices, such as smart phones, people may create and distribute different types of digital content (e.g., photos, videos). One of the problems is that digital content...
Daniele Quercia, Stephen Hailes, Licia Capra