280 search results - page 32 / 56 » Approximate nearest neighbors using sparse representations |
174
click to vote
KDD
2012
ACM
13 years 6 months ago
2012
ACM
Outlier mining in d-dimensional point sets is a fundamental and well studied data mining task due to its variety of applications. Most such applications arise in high-dimensional ...
127
Voted
ICRA
2005
IEEE
15 years 9 months ago
2005
IEEE
— This paper presents the novel insight that the SLAM information matrix is exactly sparse in a delayedstate framework. Such a framework is used in view-based representations of ...
232
Voted
ICDE
2002
IEEE
16 years 5 months ago
2002
IEEE
We investigate techniques for analysis and retrieval of object trajectories in a two or three dimensional space. Such kind of data usually contain a great amount of noise, that ma...
166
click to vote
SSDBM
2009
IEEE
15 years 10 months ago
2009
IEEE
High-dimensional indexing has been very popularly used for performing similarity search over various data types such as multimedia (audio/image/video) databases, document collectio...
145
click to vote
JMLR
2008
15 years 3 months ago
2008
In supervised learning, a training set consisting of labeled instances is used by a learning algorithm for generating a model (classifier) that is subsequently employed for decidi...