Sciweavers

856 search results - page 169 / 172
» On Randomness Measures for Social Networks.
Sort
View
VTC
2010
IEEE
195views Communications» more  VTC 2010»
13 years 5 months ago
Efficiency of Distributed Compression and Its Dependence on Sensor Node Deployments
Abstract--In this paper we analyze the energy-efficiency of distributed compression and its dependence on the node deployment strategies for Wireless Sensor Networks (WSNs). Reduce...
Frank Oldewurtel, Janne Riihijärvi, Petri M&a...
ICDCS
2009
IEEE
14 years 4 months ago
A Practical Study of Regenerating Codes for Peer-to-Peer Backup Systems
In distributed storage systems, erasure codes represent an attractive solution to add redundancy to stored data while limiting the storage overhead. They are able to provide the s...
Alessandro Duminuco, Ernst W. Biersack
WSDM
2009
ACM
187views Data Mining» more  WSDM 2009»
14 years 2 months ago
Speeding up algorithms on compressed web graphs
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
Chinmay Karande, Kumar Chellapilla, Reid Andersen
ESWS
2007
Springer
14 years 1 months ago
Understanding Large Volumes of Interconnected Individuals by Visual Exploration
Abstract. Ontologies are now used within an increasing number of realworld applications. So far, significant effort has been spend in building tools to support users in creating,...
Olaf Noppens, Thorsten Liebig
MICRO
2006
IEEE
127views Hardware» more  MICRO 2006»
14 years 1 months ago
A Predictive Performance Model for Superscalar Processors
Designing and optimizing high performance microprocessors is an increasingly difficult task due to the size and complexity of the processor design space, high cost of detailed si...
P. J. Joseph, Kapil Vaswani, Matthew J. Thazhuthav...