Sciweavers

360 search results - page 5 / 72
» Indexing the Distance: An Efficient Method to KNN Processing
Sort
View
108
Voted
BIBE
2003
IEEE
183views Bioinformatics» more  BIBE 2003»
15 years 3 months ago
Effective Indexing and Filtering for Similarity Search in Large Biosequence Databases
We present a multi-dimensional indexing approach for fast sequence similarity search in DNA and protein databases. In particular, we propose effective transformations of subsequen...
Ozgur Ozturk, Hakan Ferhatosmanoglu
EDBT
2010
ACM
185views Database» more  EDBT 2010»
15 years 2 days 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
ICDE
2006
IEEE
177views Database» more  ICDE 2006»
15 years 11 months ago
Searching Substructures with Superimposed Distance
Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...
Xifeng Yan, Feida Zhu, Jiawei Han, Philip S. Yu
MIR
2004
ACM
154views Multimedia» more  MIR 2004»
15 years 3 months ago
Fast and robust short video clip search using an index structure
In this paper, we present an index structure-based method to fast and robustly search short video clips in large video collections. First we temporally segment a given long video ...
Junsong Yuan, Ling-Yu Duan, Qi Tian, Changsheng Xu
GIS
2005
ACM
15 years 11 months ago
Two ellipse-based pruning methods for group nearest neighbor queries
Group nearest neighbor (GNN) queries are a relatively new type of operations in spatial database applications. Different from a traditional kNN query which specifies a single quer...
Hongga Li, Hua Lu, Bo Huang, Zhiyong Huang