Sciweavers

360 search results - page 61 / 72
» Indexing the Distance: An Efficient Method to KNN Processing
Sort
View
ICDE
2008
IEEE
150views Database» more  ICDE 2008»
14 years 9 months ago
On the Anonymization of Sparse High-Dimensional Data
Abstract-- Existing research on privacy-preserving data publishing focuses on relational data: in this context, the objective is to enforce privacy-preserving paradigms, such as ka...
Gabriel Ghinita, Yufei Tao, Panos Kalnis
GVD
2009
128views Database» more  GVD 2009»
13 years 5 months ago
A Self-Adaptive Insert Strategy for Content-Based Multidimensional Database Storage
In this paper, we present the current development progress of our dynamic insert strategy based on the Intelligent Cluster Index (ICIx), which is a new type of multidimensional da...
Sebastian Leuoth, Wolfgang Benn
KDD
2001
ACM
253views Data Mining» more  KDD 2001»
14 years 8 months ago
GESS: a scalable similarity-join algorithm for mining large data sets in high dimensional spaces
The similarity join is an important operation for mining high-dimensional feature spaces. Given two data sets, the similarity join computes all tuples (x, y) that are within a dis...
Jens-Peter Dittrich, Bernhard Seeger
MMSEC
2006
ACM
231views Multimedia» more  MMSEC 2006»
14 years 1 months ago
JPEG2000-based secure image authentication
We present an efficient JPEG2000-based image authentication scheme, which is robust to JPEG compression and other allowed signal processing operations. Positive wavelet-based wate...
Mathias Schlauweg, Dima Pröfrock, Erika M&uum...
ISCI
2007
141views more  ISCI 2007»
13 years 7 months ago
A performance comparison of distance-based query algorithms using R-trees in spatial databases
Efficient processing of distance-based queries (DBQs) is of great importance in spatial databases due to the wide area of applications that may address such queries. The most repr...
Antonio Corral, Jesús Manuel Almendros-Jim&...