Sciweavers

7943 search results - page 1343 / 1589
» A calculus for costed computations
Sort
View
AAAI
2012
13 years 9 months ago
Double-Bit Quantization for Hashing
Hashing, which tries to learn similarity-preserving binary codes for data representation, has been widely used for efficient nearest neighbor search in massive databases due to i...
Weihao Kong, Wu-Jun Li
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
15 years 12 months ago
Localized construction of bounded degree and planar spanner for wireless ad hoc networks
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
Yu Wang 0003, Xiang-Yang Li
CVPR
2009
IEEE
1289views Computer Vision» more  CVPR 2009»
17 years 1 months ago
Bundling Features for Large Scale Partial-Duplicate Web Image Search
In state-of-the-art image retrieval systems, an image is represented by a bag of visual words obtained by quantizing high-dimensional local image descriptors, and scalable schem...
Zhong Wu (Tsinghua University), Qifa Ke (Microsoft...
CVPR
2004
IEEE
16 years 8 months ago
Point Matching as a Classification Problem for Fast and Robust Object Pose Estimation
We propose a novel approach to point matching under large viewpoint and illumination changes that is suitable for accurate object pose estimation at a much lower computational cos...
Vincent Lepetit, Julien Pilet, Pascal Fua
CVPR
2004
IEEE
16 years 8 months ago
Collaborative Tracking of Multiple Targets
Coalescence, meaning the tracker associates more than one trajectories to some targets while loses track for others, is a challenging problem for visual tracking of multiple targe...
Ting Yu, Ying Wu
« Prev « First page 1343 / 1589 Last » Next »