Sciweavers

1806 search results - page 183 / 362
» Randomness and halting probabilities
Sort
View
WSC
1997
15 years 8 months ago
Selecting the Best System: A Decision-Theoretic Approach
The problem of selecting the best system from a finite set of alternatives is considered from a Bayesian decision-theoretic perspective. The framework presented is quite general,...
Stephen E. Chick
TIT
2010
136views Education» more  TIT 2010»
15 years 1 months ago
The existence of concatenated codes list-decodable up to the hamming bound
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...
Venkatesan Guruswami, Atri Rudra
ICML
2006
IEEE
16 years 7 months ago
Graph model selection using maximum likelihood
In recent years, there has been a proliferation of theoretical graph models, e.g., preferential attachment and small-world models, motivated by real-world graphs such as the Inter...
Adam Kalai, Ivona Bezáková, Rahul Sa...
STOC
2009
ACM
143views Algorithms» more  STOC 2009»
16 years 7 months ago
Affine dispersers from subspace polynomials
An affine disperser over Fn 2 for sources of dimension d is a function f : Fn 2 F2 such that for any affine space S Fn 2 of dimension at least d, we have {f(s) : s S} = F2. Aff...
Eli Ben-Sasson, Swastik Kopparty
RECOMB
2006
Springer
16 years 7 months ago
Markov Additive Chains and Applications to Fragment Statistics for Peptide Mass Fingerprinting
Abstract. Peptide mass fingerprinting is a technique to identify a protein from its fragment masses obtained by mass spectrometry after enzymatic digestion. Recently, much attentio...
Hans-Michael Kaltenbach, Sebastian Böcker, Sv...