860 search results - page 30 / 172 » Completeness in two-party secure computation: a computationa... |
127
click to vote
CTRSA
2001
Springer
15 years 10 months ago
2001
Springer
Computationally expensive tasks that can be parallelized are most efficiently completed by distributing the computation among a large number of processors. The growth of the Intern...
162
click to vote
CCS
2005
ACM
15 years 11 months ago
2005
ACM
In automated trust negotiation (ATN), two parties exchange digitally signed credentials that contain attribute information to establish trust and make access control decisions. Be...
240
Voted
SIGMOD
2005
ACM
16 years 6 months ago
2005
ACM
In data publishing, the owner delegates the role of satisfying user queries to a third-party publisher. As the publisher may be untrusted or susceptible to attacks, it could produ...
150
click to vote
CVPR
2005
IEEE
16 years 8 months ago
2005
IEEE
We consider the problem of calibrating a highly generic imaging model, that consists of a non-parametric association of a projection ray in 3D to every pixel in an image. Previous...
175
click to vote
CVPR
1996
IEEE
15 years 10 months ago
1996
IEEE
We propose a new method for view synthesis from real images using stereo vision. The method does not explicitly model scene geometry, and enables fast and exact generation of synt...