Sciweavers

113 search results - page 20 / 23
» Rigid Components of Random Graphs
Sort
View
VLSID
2006
IEEE
129views VLSI» more  VLSID 2006»
15 years 10 months ago
A Stimulus-Free Probabilistic Model for Single-Event-Upset Sensitivity
With device size shrinking and fast rising frequency ranges, effect of cosmic radiations and alpha particles known as Single-Event-Upset (SEU), Single-Eventtransients (SET), is a ...
Mohammad Gh. Mohammad, Laila Terkawi, Muna Albasma...
CORR
2010
Springer
130views Education» more  CORR 2010»
14 years 8 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
IPSN
2004
Springer
15 years 2 months ago
Naps: scalable, robust topology management in wireless ad hoc networks
Topology management schemes conserve energy in wireless ad hoc networks by identifying redundant nodes that may turn off their radios or other components while maintaining connec...
Brighten Godfrey, David Ratajczak
91
Voted
AAAI
2011
13 years 9 months ago
Exploiting Phase Transition in Latent Networks for Clustering
In this paper, we model the pair-wise similarities of a set of documents as a weighted network with a single cutoff parameter. Such a network can be thought of an ensemble of unwe...
Vahed Qazvinian, Dragomir R. Radev
100
Voted
STOC
2010
ACM
261views Algorithms» more  STOC 2010»
15 years 2 months ago
An Improved LP-based Approximation for Steiner Tree
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvoss...