1523 search results - page 30 / 305 » The Computational Complexity of Linear Optics |
171
click to vote
ECCV
2002
Springer
16 years 7 months ago
2002
Springer
Abstract This paper presents a novel algorithm aiming at analysis and identification of faces viewed from different poses and illumination conditions. Face analysis from a single i...
169
click to vote
SI3D
2006
ACM
15 years 12 months ago
2006
ACM
We present an interactive algorithm to compute discretized 3D Euclidean distance fields. Given a set of piecewise linear geometric primitives, our algorithm computes the distance...
141
click to vote
ASIACRYPT
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. As an extension of multi-party computation (MPC), we propose the concept of secure parallel multi-party computation which is to securely compute multi-functions against a...
203
click to vote
JMLR
2008
15 years 5 months ago
2008
Efficient and expressive comparison of sequences is an essential procedure for learning with sequential data. In this article we propose a generic framework for computation of sim...
154
click to vote
MVA
1998
15 years 5 months ago
1998
In this paper, we present a fast method for the detection of die extrusion defects in IC packages. The optical and lighting set-up as well as the details of the algorithm used for ...