116 search results - page 20 / 24 » On the tightness of the error bound in Ring-LWE |
ICML
2000
IEEE
15 years 10 months ago
2000
IEEE
This paper presents a general method to derive tight rates of convergence for numerical approximations in optimal control when we consider variable resolution grids. We study the ...
CRYPTO
2001
Springer
15 years 2 months ago
2001
Springer
Consider a scenario where an l-bit secret has been distributed among n players by an honest dealer using some secret sharing scheme. Then, if all players behave honestly, the secre...
119
click to vote
ARITH
2011
IEEE
13 years 9 months ago
2011
IEEE
—We consider the problem of short division — i.e., approximate quotient — of multiple-precision integers. We present ready-to-implement algorithms that yield an approximation...
104
click to vote
SIGMOD
2001
ACM
15 years 9 months ago
2001
ACM
Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data....
118
click to vote
SODA
2012
ACM
13 years 17 hour ago
2012
ACM
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...