Sciweavers

360 search results - page 4 / 72
» Indexing the Distance: An Efficient Method to KNN Processing
Sort
View
ICDE
2004
IEEE
138views Database» more  ICDE 2004»
14 years 8 months ago
Making the Pyramid Technique Robust to Query Types and Workloads
The effectiveness of many existing high-dimensional indexing structures is limited to specific types of queries and workloads. For example, while the Pyramid technique and the iMi...
Rui Zhang 0003, Beng Chin Ooi, Kian-Lee Tan
VC
2008
135views more  VC 2008»
13 years 7 months ago
A new feature-based method for robust and efficient rigid-body registration of overlapping point clouds
Abstract We propose a new featurebased registration method for rigidbody alignment of overlapping point clouds (PCs) efficiently under the influence of noise and outliers. The prop...
Cagatay Basdogan, A. Cengiz Oztireli
CIKM
2006
Springer
13 years 9 months ago
Efficient range-constrained similarity search on wavelet synopses over multiple streams
Due to the resource limitation in the data stream environment, it has been reported that answering user queries according to the wavelet synopsis of a stream is an essential abili...
Hao-Ping Hung, Ming-Syan Chen
ICDE
2010
IEEE
282views Database» more  ICDE 2010»
14 years 7 months ago
Quantile-Based KNN Over Multi-Valued Objects
K Nearest Neighbor search has many applications including data mining, multi-media, image processing, and monitoring moving objects. In this paper, we study the problem of KNN over...
Wenjie Zhang, Xuemin Lin, Muhammad Aamir Cheema, Y...
ICDE
2007
IEEE
185views Database» more  ICDE 2007»
14 years 8 months ago
On k-Nearest Neighbor Searching in Non-Ordered Discrete Data Spaces
A k-nearest neighbor (k-NN) query retrieves k objects from a database that are considered to be the closest to a given query point. Numerous techniques have been proposed in the p...
Dashiell Kolbe, Qiang Zhu, Sakti Pramanik