283 search results - page 22 / 57 » Local Search in Histogram Construction |
110
click to vote
COMPGEOM
2006
ACM
15 years 7 months ago
2006
ACM
Given a metric space (X, dX), c ≥ 1, r > 0, and p, q ∈ [0, 1], a distribution over mappings H : X → N is called a (r, cr, p, q)-sensitive hash family if any two points in...
142
click to vote
TMC
2008
15 years 1 months ago
2008
A k-hop dominating set is a subset of nodes such that each node not in the set can be reached within k hops from at least one node in the set. A connected k-hop dominating set can ...
105
click to vote
CONIELECOMP
2005
IEEE
15 years 7 months ago
2005
IEEE
The approximate searching problem on compressed text tries to find all the matches of a pattern in a compressed text, without decompressing it and considering that the match of th...
118
Voted
ICCV
2009
IEEE
14 years 11 months ago
2009
IEEE
By combining Histograms of Oriented Gradients (HOG) and Local Binary Pattern (LBP) as the feature set, we propose a novel human detection approach capable of handling partial occl...
121
Voted
CVIU
2008
15 years 1 months ago
2008
We propose a novel scheme for using supervised learning for function-based classification of objects in 3D images. During the learning process, a generic multi-level hierarchical ...