Sciweavers

396 search results - page 75 / 80
» Exact Algorithms for Graph Homomorphisms
Sort
View
CORR
2011
Springer
159views Education» more  CORR 2011»
13 years 2 months ago
Scalable constructions of fractional repetition codes in distributed storage systems
Abstract—In distributed storage systems built using commodity hardware, it is necessary to store multiple replicas of every data chunk in order to ensure system reliability. In s...
Joseph C. Koo, John T. Gill III
TIT
2010
103views Education» more  TIT 2010»
13 years 2 months ago
Analysis of absorbing sets and fully absorbing sets of array-based LDPC codes
The class of low-density parity-check (LDPC) codes is attractive, since such codes can be decoded using practical message-passing algorithms, and their performance is known to app...
Lara Dolecek, Zhengya Zhang, Venkat Anantharam, Ma...
ALGORITHMICA
2011
13 years 2 months ago
On Bounded Leg Shortest Paths Problems
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...
Liam Roditty, Michael Segal
STOC
2010
ACM
181views Algorithms» more  STOC 2010»
13 years 8 months ago
Load balancing and orientability thresholds for random hypergraphs
Let h > w > 0 be two fixed integers. Let H be a random hypergraph whose hyperedges are uniformly of size h. To w-orient a hyperedge, we assign exactly w of its vertices posi...
Pu Gao, Nicholas C. Wormald
IPSN
2004
Springer
14 years 1 months ago
Lattice sensor networks: capacity limits, optimal routing and robustness to failures
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
Guillermo Barrenechea, Baltasar Beferull-Lozano, M...