Sciweavers

110 search results - page 17 / 22
» Fast Nearest Neighbor Search on Road Networks
Sort
View
AAAI
2012
11 years 10 months ago
Double-Bit Quantization for Hashing
Hashing, which tries to learn similarity-preserving binary codes for data representation, has been widely used for efficient nearest neighbor search in massive databases due to i...
Weihao Kong, Wu-Jun Li
ECCV
2006
Springer
14 years 9 months ago
Region Covariance: A Fast Descriptor for Detection and Classification
We describe a new region descriptor and apply it to two problems, object detection and texture classification. The covariance of d-features, e.g., the three-dimensional color vecto...
Oncel Tuzel, Fatih Porikli, Peter Meer
BIBE
2003
IEEE
183views Bioinformatics» more  BIBE 2003»
14 years 1 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
2009
ACM
277views Database» more  EDBT 2009»
14 years 9 days ago
G-hash: towards fast kernel-based similarity search in large graph databases
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...
CDC
2008
IEEE
148views Control Systems» more  CDC 2008»
14 years 2 months ago
Distributed cut detection in sensor networks
— We propose a distributed algorithm to detect “cuts” in sensor networks, i.e., the failure of a set of nodes that separates the networks into two or more components. The alg...
Prabir Barooah