Sciweavers

2681 search results - page 74 / 537
» Problem F
Sort
View
CORR
2010
Springer
147views Education» more  CORR 2010»
13 years 10 months ago
Distributed Storage Codes Meet Multiple-Access Wiretap Channels
We consider i) the overhead minimization of maximum-distance seperable (MDS) storage codes for the repair of a single failed node and ii) the total secure degrees-of-freedom (S-DoF...
Dimitris S. Papailiopoulos, Alexandros G. Dimakis
IWPEC
2009
Springer
14 years 4 months ago
Even Faster Algorithm for Set Splitting!
In the p-Set Splitting problem we are given a universe U, a family F of subsets of U and a positive integer k and the objective is to find a partition of U into W and B such that...
Daniel Lokshtanov, Saket Saurabh
FOCS
2005
IEEE
14 years 3 months ago
Lower Bounds for the Noisy Broadcast Problem
We prove the first non-trivial (super linear) lower bound in the noisy broadcast model, defined by El Gamal in [6]. In this model there are n + 1 processors P0, P1, . . . , Pn, ...
Navin Goyal, Guy Kindler, Michael E. Saks
ISAAC
2004
Springer
125views Algorithms» more  ISAAC 2004»
14 years 3 months ago
Local Gapped Subforest Alignment and Its Application in Finding RNA Structural Motifs
RNA molecules whose secondary structures contain similar substructures often have similar functions. Therefore, an important task in the study of RNA is to develop methods for disc...
Jesper Jansson, Ngo Trung Hieu, Wing-Kin Sung
JUCS
2007
98views more  JUCS 2007»
13 years 10 months ago
Random k-GD-Sat Model and its Phase Transition
Abstract: We present a new type of sat problem called the k-gd-sat, which generalizes k-sat and gd-sat. In k-gd-sat, clause lengths have geometric distribution, controlled by a pro...
Milena Vujosevic-Janicic, Jelena Tomasevic, Predra...