Sciweavers

232 search results - page 13 / 47
» Fast High-Dimensional Data Search in Incomplete Databases
Sort
View
SIGMOD
1997
ACM
127views Database» more  SIGMOD 1997»
15 years 3 months ago
Fast Parallel Similarity Search in Multimedia Databases
Most similarity search techniques map the data objects into some high-dimensional feature space. The similarity search then corresponds to a nearest-neighbor search in the feature...
Stefan Berchtold, Christian Böhm, Bernhard Br...
TCSV
2010
14 years 6 months ago
Efficient and Robust Detection of Duplicate Videos in a Large Database
We present an efficient and accurate method for duplicate video detection in a large database using video fingerprints. We have empirically chosen the Color Layout Descriptor, a c...
Anindya Sarkar, Vishwakarma Singh, Pratim Ghosh, B...
ISMIS
1999
Springer
15 years 3 months ago
Applications and Research Problems of Subgroup Mining
Knowledge Discovery in Databases (KDD) is a data analysis process which, in contrast to conventional data analysis, automatically generates and evaluates very many hypotheses, deal...
Willi Klösgen
VLDB
1987
ACM
66views Database» more  VLDB 1987»
15 years 3 months ago
A New Compression Method with Fast Searching on Large Databases
In this paper, a new compression method for constant removal from very large scientific and statistical databases is presented. The new method combines the best features from seve...
Jianzhong Li, Doron Rotem, Harry K. T. Wong
EDBT
2009
ACM
277views Database» more  EDBT 2009»
15 years 4 months 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 ...