Sciweavers

649 search results - page 48 / 130
» Some Methods of Replacing the Nearest Neighbor Method
Sort
View
VLDB
2004
ACM
125views Database» more  VLDB 2004»
14 years 1 months ago
Reverse kNN Search in Arbitrary Dimensionality
Given a point q, a reverse k nearest neighbor (RkNN) query retrieves all the data points that have q as one of their k nearest neighbors. Existing methods for processing such quer...
Yufei Tao, Dimitris Papadias, Xiang Lian
ITNG
2008
IEEE
14 years 2 months ago
An Efficient Technique for Distance Computation in Road Networks
With recent advances in wireless communication and position technologies, it became possible to collect and record trajectories of moving objects. Thus, many services in road netw...
Xu Jianqiu, Victor Teixeira de Almeida, Qin Xiaoli...
PRICAI
2010
Springer
13 years 5 months ago
Sparse Representation: Extract Adaptive Neighborhood for Multilabel Classification
Unlike traditional classification tasks, multilabel classification allows a sample to associate with more than one label. This generalization naturally arises the difficulty in cla...
Shuo Xiang, Songcan Chen, Lishan Qiao
PAMI
2011
13 years 2 months ago
Parallel Spectral Clustering in Distributed Systems
Spectral clustering algorithms have been shown to be more effective in finding clusters than some traditional algorithms such as k-means. However, spectral clustering suffers fro...
Wen-Yen Chen, Yangqiu Song, Hongjie Bai, Chih-Jen ...
ICPR
2008
IEEE
14 years 9 months ago
A contrario matching of SIFT-like descriptors
In this paper, the matching of SIFT-like features [5] between images is studied. The goal is to decide which matches between descriptors of two datasets should be selected. This m...
Julie Delon, Julien Rabin, Yann Gousseau