Sciweavers

45 search results - page 2 / 9
» Storage Capacity of Labeled Graphs
Sort
View
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 4 months ago
Fractional Repetition Codes for Repair in Distributed Storage Systems
Abstract—We introduce a new class of exact MinimumBandwidth Regenerating (MBR) codes for distributed storage systems, characterized by a low-complexity uncoded repair process tha...
Salim Y. El Rouayheb, Kannan Ramchandran
ATAL
2005
Springer
13 years 11 months ago
Data storage in unreliable multi-agent networks
The distributed data storage on unreliable devices, connected by a short-range radio network is analyzed. Failing devices incur loss of data. To prevent the loss, the data is spli...
Filip Miletic, Patrick Dewilde
JODL
2006
88views more  JODL 2006»
13 years 6 months ago
BroadScale: Efficient scaling of heterogeneous storage systems
Abstract Scalable storage architectures enable digital libraries and archives for the addition or removal of storage devices to increase storage capacity and bandwidth or retire ol...
Shu-Yuen Didi Yao, Cyrus Shahabi, Roger Zimmermann
CIKM
2004
Springer
13 years 11 months ago
Node ranking in labeled directed graphs
Our work is motivated by the problem of ranking hyperlinked documents for a given query. Given an arbitrary directed graph with edge and node labels, we present a new flow-based ...
Krishna Prasad Chitrapura, Srinivas R. Kashyap
CIKM
2005
Springer
13 years 11 months ago
Compact reachability labeling for graph-structured data
Testing reachability between nodes in a graph is a well-known problem with many important applications, including knowledge representation, program analysis, and more recently, bi...
Hao He, Haixun Wang, Jun Yang 0001, Philip S. Yu