190 search results - page 13 / 38 » Providing Diversity in K-Nearest Neighbor Query Results |
EDBT
2008
ACM
14 years 8 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...
ICPP
2005
IEEE
14 years 2 months ago
2005
IEEE
The existing searching schemes in Peer-to-Peer (P2P) networks are either forwarding-based or non-forwarding based. In forwarding-based schemes, queries are forwarded from the quer...
CVPR
2004
IEEE
14 years 10 months ago
2004
IEEE
We consider the problem of the binary classification on imbalanced data, in which nearly all the instances are labelled as one class, while far fewer instances are labelled as the...
MSN
2007
Springer
14 years 2 months ago
2007
Springer
— The recent researches in wireless networks prompt the opportunistic transmission that exploiting channel fluctuations to improve the overall system performance. In wireless ad...
PODS
1997
ACM
14 years 19 days ago
1997
ACM
In this paper, we present a new cost model for nearest neighbor search in high-dimensional data space. We first analyze different nearest neighbor algorithms, present a generaliza...