Sciweavers

38 search results - page 4 / 8
» Computing separable functions via gossip
Sort
View
IJCV
2006
192views more  IJCV 2006»
13 years 9 months ago
Piecewise-Smooth Dense Optical Flow via Level Sets
We propose a new algorithm for dense optical flow computation. Dense optical flow schemes are challenged by the presence of motion discontinuities. In state of the art optical flo...
Tomer Amiaz, Nahum Kiryati
CRYPTO
2005
Springer
125views Cryptology» more  CRYPTO 2005»
14 years 3 months ago
Secure Computation Without Authentication
In the setting of secure multiparty computation, a set of parties wish to jointly compute some function of their inputs. Such a computation must preserve certain security propertie...
Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pa...
NIPS
2004
13 years 11 months ago
Face Detection - Efficient and Rank Deficient
This paper proposes a method for computing fast approximations to support vector decision functions in the field of object detection. In the present approach we are building on an...
Wolf Kienzle, Gökhan H. Bakir, Matthias O. Fr...
DICTA
2009
13 years 7 months ago
Multi-projective Parameter Estimation for Sets of Homogeneous Matrices
A number of problems in computer vision require the estimation of a set of matrices, each of which is defined only up to an individual scale factor and represents the parameters of...
Wojciech Chojnacki, Rhys Hill, Anton van den Henge...
BIRTHDAY
2010
Springer
13 years 11 months ago
Choiceless Computation and Symmetry
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
Benjamin Rossman