106 search results - page 14 / 22 » Fast Approximate Point Set Matching for Information Retrieva... |
112
click to vote
CVPR
2010
IEEE
15 years 7 months ago
2010
IEEE
Searching approximate nearest neighbors in large scale high dimensional data set has been a challenging problem. This paper presents a novel and fast algorithm for learning binary...
FIMI
2004
15 years 1 months ago
2004
Trie is a popular data structure in frequent itemset mining (FIM) algorithms. It is memory-efficient, and allows fast construction and information retrieval. Many trie-related tec...
150
click to vote
SIGIR
2010
ACM
14 years 6 months ago
2010
ACM
TION ABSTRACT Personalised Video Retrieval: Application of Implicit Feedback and Semantic User Profiles Frank Hopfgartner University of Glasgow Glasgow G12 8QQ United Kingdom A ch...
65
Voted
PAMI
2006
14 years 11 months ago
2006
In this article we present a novel convexity measure for object shape analysis. The proposed method is based on the idea of generating pairs of points from a set, and measuring th...
TIP
2008
14 years 11 months ago
2008
Density estimation for observational data plays an integral role in a broad spectrum of applications, e.g. statistical data analysis and information-theoretic image registration. ...