149 search results - page 3 / 30 » Uniform hashing in constant time and linear space |
CVPR
2010
IEEE
14 years 1 months ago
2010
IEEE
In this paper, we consider the problem of stereo matching using loopy belief propagation. Unlike previous methods which focus on the original spatial resolution, we hierarchically...
CVPR
2012
IEEE
11 years 7 months ago
2012
IEEE
There has been growing interest in mapping image data onto compact binary codes for fast near neighbor search in vision applications. Although binary codes are motivated by their ...
ICALP
2010
Springer
13 years 10 months ago
2010
Springer
A discrete distribution D over Σ1 × · · · × Σn is called (non-uniform) k-wise independent if for any set of k indexes {i1, . . . , ik} and for any z1 ∈ Σi1 , . . . , zk ...
COMPGEOM
2005
ACM
13 years 7 months ago
2005
ACM
We present a near linear time algorithm for constructing hierarchical nets in finite metric spaces with constant doubling dimension. This data-structure is then applied to obtain...
SDM
2007
SIAM
13 years 6 months ago
2007
SIAM
Time series are difficult to monitor, summarize and predict. Segmentation organizes time series into few intervals having uniform characteristics (flatness, linearity, modality,...