4 search results - page 1 / 1 » Deterministic construction of an approximate M-ellipsoid and... |
SODA
2012
ACM
11 years 7 months ago
2012
ACM
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
Wigderson and Xiao presented an efficient derandomization of the matrix Chernoff bound using the method of pessimistic estimators [WX08]. Building on their construction, we prese...
APPROX
2004
Springer
13 years 10 months ago
2004
Springer
A quantum encryption scheme (also called private quantum channel, or state randomization protocol) is a one-time pad for quantum messages. If two parties share a classical random s...
ISMIS
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. A multi-relational clustering method is presented which can be applied to complex knowledge bases storing resources expressed in the standard Semantic Web languages. It a...