256 search results - page 21 / 52 » On a Generalized Notion of Mistake Bounds |
113
click to vote
STOC
2009
ACM
16 years 12 days ago
2009
ACM
We design the first efficient algorithms and prove new combinatorial bounds for list decoding tensor products of codes and interleaved codes. ? We show that for every code, the rat...
171
click to vote
POPL
2008
ACM
16 years 3 days ago
2008
ACM
When scripts in untyped languages grow into large programs, maintaining them becomes difficult. A lack of types in typical scripting languages means that programmers must (re)disc...
ICITS
2009
14 years 9 months ago
2009
Abstract. The term indistinguishability amplification refers to a setting where a certain construction combines two (or more) cryptographic primitives of the same type to improve t...
JUCS
2010
14 years 6 months ago
2010
: We investigate the relationship between computable metric spaces (X, d, ) and (X, d, ), where (X, d) is a given metric space. In the case of Euclidean space, and are equivalent ...
100
click to vote
ICALP
2010
Springer
15 years 4 months ago
2010
Springer
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition s...