Sciweavers

1661 search results - page 152 / 333
» Space-time Interest Points
Sort
View
CRYPTO
2012
Springer
223views Cryptology» more  CRYPTO 2012»
13 years 17 days ago
Collusion-Preserving Computation
In collusion-free protocols, subliminal communication is impossible and parties are thus unable to communicate “any information beyond what the protocol allows”. Collusion-fre...
Joël Alwen, Jonathan Katz, Ueli Maurer, Vassi...
SODA
2012
ACM
196views Algorithms» more  SODA 2012»
13 years 17 days ago
Polytope approximation and the Mahler volume
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...
Sunil Arya, Guilherme Dias da Fonseca, David M. Mo...
ECCV
2008
Springer
16 years 21 hour ago
Pose Priors for Simultaneously Solving Alignment and Correspondence
Abstract. Estimating a camera pose given a set of 3D-object and 2Dimage feature points is a well understood problem when correspondences are given. However, when such correspondenc...
Francesc Moreno-Noguer, Vincent Lepetit, Pascal Fu...
ECCV
2000
Springer
16 years 2 hour ago
Divergence-Based Medial Surfaces
The medial surface of a volumetric object is of significant interest for shape analysis. However, its numerical computation can be subtle. Methods based on Voronoi techniques prese...
Sylvain Bouix, Kaleem Siddiqi
173
Voted
ICDE
2006
IEEE
138views Database» more  ICDE 2006»
15 years 11 months ago
SUBSKY: Efficient Computation of Skylines in Subspaces
Given a set of multi-dimensional points, the skyline contains the best points according to any preference function that is monotone on all axes. In practice, applications that req...
Yufei Tao, Xiaokui Xiao, Jian Pei