37 search results - page 7 / 8 » BoostMap: An Embedding Method for Efficient Nearest Neighbor... |
ESWS
2008
Springer
13 years 7 months ago
2008
Springer
In order to overcome the limitations of deductive logic-based approaches to deriving operational knowledge from ontologies, especially when data come from distributed sources, indu...
ICDE
1999
IEEE
14 years 7 months ago
1999
IEEE
Time series stored as feature vectors can be indexed by multidimensional index trees like R-Trees for fast retrieval. Due to the dimensionality curse problem, transformations are ...
KDD
2008
ACM
14 years 6 months ago
2008
ACM
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
ISM
2006
IEEE
13 years 5 months ago
2006
IEEE
A novel indexing and access method, called Affinity Hybrid Tree (AH-Tree), is proposed to organize large image data sets efficiently and to support popular image access mechanisms...
ICDE
2008
IEEE
14 years 7 months ago
2008
IEEE
Many applications require finding objects closest to a specified location that contains a set of keywords. For example, online yellow pages allow users to specify an address and a ...