475 search results - page 44 / 95 » Efficient Set Similarity Joins Using Min-prefixes |
259
click to vote
SIGMOD
2006
ACM
16 years 5 months ago
2006
ACM
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
275
click to vote
3DPVT
2006
IEEE
15 years 7 months ago
2006
IEEE
This paper introduces a feature based method for the fast generation of sparse 3D point clouds from multiple images with known pose. We extract sub-pixel edge elements (2D positio...
191
click to vote
CVPR
2004
IEEE
16 years 7 months ago
2004
IEEE
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
181
click to vote
CORR
2010
Springer
15 years 19 days ago
2010
Springer
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] over fi...
182
Voted
HICSS
2003
IEEE
15 years 11 months ago
2003
IEEE
For many years mobile visitor information systems for museums or exhibitions are a topic of research. Research prototypes aim to provide the user with powerful means for organizin...