1139 search results - page 25 / 228 » Bounded Ideation Theory |
STOC
2003
ACM
14 years 9 months ago
2003
ACM
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
CRYPTO
2009
Springer
14 years 3 months ago
2009
Springer
We prove the equivalence, up to a small polynomial approximation factor n/ log n, of the lattice problems uSVP (unique Shortest Vector Problem), BDD (Bounded Distance Decoding) and...
PLDI
1998
ACM
14 years 1 months ago
1998
ACM
We present a type-based approach to eliminating array bound checking and list tag checking by conservatively extending Standard ML with a restricted form of dependent types. This ...
IPL
2010
13 years 3 months ago
2010
This paper deals with broadcasting in a network with t-locally bounded Byzantine faults. One of the simplest broadcasting algorithms under Byzantine failures is referred to as a c...
TCS
2002
13 years 8 months ago
2002
We investigate Martin's game (as described in Arruda et al. (Eds.), On Random R. E. Sets, Non-Classical Logics, Model Theory and Computability, North-Holland, Amsterdam, 1977...