Sciweavers

1399 search results - page 195 / 280
» Multi-party Finite Computations
Sort
View
155
Voted
SIGGRAPH
1994
ACM
15 years 8 months ago
A framework for the analysis of error in global illumination algorithms
In this paper we identify sources of error in global illumination algorithms and derive bounds for each distinct category. Errors arise from three sources: inaccuracies in the bou...
James Arvo, Kenneth E. Torrance, Brian E. Smits
PARLE
1994
15 years 8 months ago
Run-Time Optimization of Sparse Matrix-Vector Multiplication on SIMD Machines
Sparse matrix-vector multiplication forms the heart of iterative linear solvers used widely in scientific computations (e.g., finite element methods). In such solvers, the matrix-v...
Louis H. Ziantz, Can C. Özturan, Boleslaw K. ...
146
Voted
CVPR
2007
IEEE
16 years 6 months ago
An MRF and Gaussian Curvature Based Shape Representation for Shape Matching
Matching and registration of shapes is a key issue in Computer Vision, Pattern Recognition, and Medical Image Analysis. This paper presents a shape representation framework based ...
Pengdong Xiao, Nick Barnes, Tibério S. Caet...
CGI
2004
IEEE
15 years 8 months ago
Physically-Based Simulation of Objects Represented by Surface Meshes
Objects and scenes in virtual worlds such as 3-d computer games are typically represented by polygonal surface meshes. On the other hand, physically-based simulations of deformati...
Matthias Müller, Matthias Teschner, Markus H....
CRYPTO
2010
Springer
181views Cryptology» more  CRYPTO 2010»
15 years 5 months ago
On the Efficiency of Classical and Quantum Oblivious Transfer Reductions
Due to its universality oblivious transfer (OT) is a primitive of great importance in secure multi-party computation. OT is impossible to implement from scratch in an unconditional...
Severin Winkler, Jürg Wullschleger