325 search results - page 44 / 65 » Group Nearest Neighbor Queries |
105
click to vote
EDBT
2008
ACM
16 years 1 months ago
2008
ACM
Due to the well-known dimensionality curse problem, search in a high-dimensional space is considered as a "hard" problem. In this paper, a novel symmetrical encoding-bas...
126
click to vote
KES
2004
Springer
15 years 7 months ago
2004
Springer
Artificial Intelligence algorithms can be divided into two groups according to the type of problems they solve. Knowledge-intensive domains contain explicit knowledge, whereas know...
108
click to vote
VLDB
2005
ACM
15 years 7 months ago
2005
ACM
We study the problem of applying adaptive filters for approximate query processing in a distributed stream environment. We propose filter bound assignment protocols with the obj...
124
click to vote
DATESO
2010
14 years 11 months ago
2010
Abstract. The task of similarity search in multimedia databases is usually accomplished by range or k nearest neighbor queries. However, the expressing power of these "single-...
122
click to vote
ICDE
2010
IEEE
16 years 1 months ago
2010
IEEE
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...