1369 search results - page 35 / 274 » Lattice computations for random numbers |
EUROCRYPT
2011
Springer
13 years 10 days ago
2011
Springer
An additively-homomorphic encryption scheme enables us to compute linear functions of an encrypted input by manipulating only the ciphertexts. We define the relaxed notion of a se...
STOC
2001
ACM
14 years 9 months ago
2001
ACM
Given a matrix A, it is often desirable to find a good approximation to A that has low rank. We introduce a simple technique for accelerating the computation of such approximation...
IJCAI
2007
13 years 10 months ago
2007
Clustering accuracy of partitional clustering algorithm for categorical data primarily depends upon the choice of initial data points (modes) to instigate the clustering process. ...
VLDB
2007
ACM
14 years 9 months ago
2007
ACM
Current skyline evaluation techniques follow a common paradigm that eliminates data elements from skyline consideration by finding other elements in the dataset that dominate them...
ISTCS
1993
Springer
14 years 28 days ago
1993
Springer
The design of fiducials for precise image registration is of major practical importance in computer vision, especially in automatic inspection applications. We analyze the subpix...