Sciweavers

860 search results - page 57 / 172
» Lower Bounds on the Size of Test Data Sets
Sort
View
SIGMOD
2004
ACM
126views Database» more  SIGMOD 2004»
14 years 8 months ago
Indexing Spatio-Temporal Trajectories with Chebyshev Polynomials
In this paper, we attempt to approximate and index a ddimensional (d 1) spatio-temporal trajectory with a low order continuous polynomial. There are many possible ways to choose ...
Yuhan Cai, Raymond T. Ng
KDD
2004
ACM
103views Data Mining» more  KDD 2004»
14 years 8 months ago
An objective evaluation criterion for clustering
We propose and test an objective criterion for evaluation of clustering performance: How well does a clustering algorithm run on unlabeled data aid a classification algorithm? The...
Arindam Banerjee, John Langford
CVPR
2009
IEEE
15 years 2 months ago
Learning query-dependent prefilters for scalable image retrieval
We describe an algorithm for similar-image search which is designed to be efficient for extremely large collections of images. For each query, a small response set is selected by...
Lorenzo Torresani (Dartmouth College), Martin Szum...
PAKDD
2009
ACM
149views Data Mining» more  PAKDD 2009»
14 years 9 days ago
A New Local Distance-Based Outlier Detection Approach for Scattered Real-World Data
Detecting outliers which are grossly different from or inconsistent with the remaining dataset is a major challenge in real-world KDD applications. Existing outlier detection met...
Ke Zhang, Marcus Hutter, Huidong Jin
IJACTAICIT
2010
189views more  IJACTAICIT 2010»
13 years 5 months ago
An Improved Algorithm for Data Hiding Using HH-subband Haar Wavelet Coefficients
This paper presents an improved adaptive algorithm for enhanced data hiding under HH-subband Haar Wavelet coefficients of a gray scale host image. The algorithm uses an optimal se...
Stuti Bazaj, Sachin Modi, Anand Mohan, S. P. Singh