Sciweavers

297 search results - page 23 / 60
» Every Sequence Is Decompressible from a Random One
Sort
View
WCE
2007
15 years 5 days ago
On the Statistical Distribution of Stationary Segment Lengths of Road Vehicles Vibrations
— This paper presents an important outcome of a research programme which focuses on the development of a method for synthesizing, under controlled conditions in the laboratory, t...
Vincent Rouillard
CSR
2011
Springer
14 years 2 months ago
The Complexity of Inversion of Explicit Goldreich's Function by DPLL Algorithms
The Goldreich’s function has n binary inputs and n binary outputs. Every output depends on d inputs and is computed from them by the fixed predicate of arity d. Every Goldreich...
Dmitry Itsykson, Dmitry Sokolov
BMCBI
2011
14 years 2 months ago
Protein alignment algorithms with an efficient backtracking routine on multiple GPUs
Background: Pairwise sequence alignment methods are widely used in biological research. The increasing number of sequences is perceived as one of the upcoming challenges for seque...
Jacek Blazewicz, Wojciech Frohmberg, Michal Kierzy...
CORR
2007
Springer
132views Education» more  CORR 2007»
14 years 11 months ago
Probabilistic Analysis of Linear Programming Decoding
Abstract—We initiate the probabilistic analysis of linear programming (LP) decoding of low-density parity-check (LDPC) codes. Specifically, we show that for a random LDPC code e...
Constantinos Daskalakis, Alexandros G. Dimakis, Ri...
DAGSTUHL
2007
15 years 14 days ago
Anonymity-Proof Voting Rules
A (randomized, anonymous) voting rule maps any multiset of total orders (aka. votes) over a fixed set of alternatives to a probability distribution over these alternatives. A voti...
Vincent Conitzer