Sciweavers

331 search results - page 12 / 67
» A Clustering Algorithm Based Absorbing Nearest Neighbors
Sort
View
ICDE
2011
IEEE
380views Database» more  ICDE 2011»
12 years 11 months ago
Influence Zone: Efficiently Processing Reverse k Nearest Neighbors Queries
Given a set of objects and a query q, a point p is called the reverse k nearest neighbor (RkNN) of q if q is one of the k closest objects of p. In this paper, we introduce the c...
Muhammad Aamir Cheema, Xuemin Lin, Wenjie Zhang, Y...
DASFAA
2007
IEEE
208views Database» more  DASFAA 2007»
14 years 1 months ago
Probabilistic Nearest-Neighbor Query on Uncertain Objects
Nearest-neighbor queries are an important query type for commonly used feature databases. In many different application areas, e.g. sensor databases, location based services or fac...
Hans-Peter Kriegel, Peter Kunath, Matthias Renz
ICDAR
2005
IEEE
14 years 1 months ago
An Approach to Identify Unique Styles in Online Handwriting Recognition
We describe a method for identifying different writing styles of online handwritten characters based on clustering. The motivation of this experiment is to develop automatic chara...
A. Bharath, V. Deepu, Sriganesh Madhvanath
TVCG
2010
141views more  TVCG 2010»
13 years 5 months ago
Fast Construction of k-Nearest Neighbor Graphs for Point Clouds
—We present a parallel algorithm for k-nearest neighbor graph construction that uses Morton ordering. Experiments show that our approach has the following advantages over existin...
Michael Connor, Piyush Kumar
ICDE
2007
IEEE
128views Database» more  ICDE 2007»
14 years 9 months ago
Efficient Evaluation of All-Nearest-Neighbor Queries
The All Nearest Neighbor (ANN) operation is a commonly used primitive for analyzing large multi-dimensional datasets. Since computing ANN is very expensive, in previous works R*-t...
Yun Chen, Jignesh M. Patel