147 search results - page 29 / 30 » Logarithmic keying |
SIAMCOMP
1998
13 years 7 months ago
1998
Polynomial-time safe and unsafe approximations for intractable sets were introduced by Meyer and Paterson [Technical Report TM-126, Laboratory for Computer Science, MIT, Cambridge,...
SIAMDM
2010
13 years 5 months ago
2010
In this paper we study the problem of finding maximally sized subsets of binary strings (codes) of equal length that are immune to a given number r of repetitions, in the sense th...
ASIACRYPT
2010
Springer
13 years 5 months ago
2010
Springer
Blind signatures (BS), introduced by Chaum, have become a cornerstone in privacy-oriented cryptography. Using hard lattice problems, such as the shortest vector problem, as the bas...
SIAMMAX
2010
13 years 2 months ago
2010
Abstract. Linear inverse problems with uncertain measurement matrices appear in many different applications. One of the standard techniques for solving such problems is the total l...
TSP
2012
12 years 3 months ago
2012
—Base station (BS) coordination is a key technique to handle intercell interference (ICI) in cellular networks. Nevertheless, recent work on scheduling indicates that the value o...