459 search results - page 61 / 92 » Computational Complexity of Probabilistic Disambiguation |
135
Voted
ACSC
2008
IEEE
15 years 10 months ago
2008
IEEE
We propose a more efficient privacy preserving set intersection protocol which improves the previously known result by a factor of O(N) in both the computation and communication c...
143
Voted
IACR
2011
14 years 3 months ago
2011
In this paper, we study the complexity of secure multiparty computation using only the secure arithmetic black-box of a finite field, counting the cost by the number of secure m...
144
Voted
CVPR
2007
IEEE
16 years 5 months ago
2007
IEEE
Image patches are fundamental elements for object modeling and recognition. However, there has not been a panoramic study of the structures of the whole ensemble of natural image ...
157
click to vote
ECCV
2006
Springer
16 years 5 months ago
2006
Springer
Abstract. This contribution proposes a compositional approach to visual object categorization of scenes. Compositions are learned from the Caltech 101 database1 intermediate abstra...
159
click to vote
ECCV
2000
Springer
16 years 5 months ago
2000
Springer
A probabilistic method for tracking 3D articulated human figures in monocular image sequences is presented. Within a Bayesian framework, we define a generative model of image appea...