Sciweavers

58 search results - page 3 / 12
» Surface k-NN Query Processing
Sort
View
ICDE
2004
IEEE
138views Database» more  ICDE 2004»
14 years 6 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
ICDE
2006
IEEE
191views Database» more  ICDE 2006»
14 years 6 months ago
Query Decomposition: A Multiple Neighborhood Approach to Relevance Feedback Processing in Content-based Image Retrieval
Today's Content-Based Image Retrieval (CBIR) techniques are based on the "k-nearest neighbors" (kNN) model. They retrieve images from a single neighborhood using lo...
Kien A. Hua, Ning Yu, Danzhou Liu
PVLDB
2010
152views more  PVLDB 2010»
13 years 3 months ago
k-Nearest Neighbors in Uncertain Graphs
Complex networks, such as biological, social, and communication networks, often entail uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of sim...
Michalis Potamias, Francesco Bonchi, Aristides Gio...
VLDB
2004
ACM
227views Database» more  VLDB 2004»
13 years 10 months ago
Approximate NN queries on Streams with Guaranteed Error/performance Bounds
In data stream applications, data arrive continuously and can only be scanned once as the query processor has very limited memory (relative to the size of the stream) to work with...
Nick Koudas, Beng Chin Ooi, Kian-Lee Tan, Rui Zhan...
EDBT
2010
ACM
185views Database» more  EDBT 2010»
13 years 7 months ago
Probabilistic threshold k nearest neighbor queries over moving objects in symbolic indoor space
The availability of indoor positioning renders it possible to deploy location-based services in indoor spaces. Many such services will benefit from the efficient support for k n...
Bin Yang 0002, Hua Lu, Christian S. Jensen