569 search results - page 98 / 114 » An efficient clustering method for k-anonymization |
DEXA
2006
Springer
14 years 8 days ago
2006
Springer
Abstract. Nearest neighbor search has a wide variety of applications. Unfortunately, the majority of search methods do not scale well with dimensionality. Recent efforts have been ...
CVPR
2008
IEEE
13 years 10 months ago
2008
IEEE
In this paper, we propose a novel learning-based face hallucination framework built in DCT domain, which can recover the high-resolution face image from a single lowresolution one...
SDM
2010
SIAM
13 years 10 months ago
2010
SIAM
The dimensionality reduction problem has been widely studied in the database literature because of its application for concise data representation in a variety of database applica...
CGF
2008
13 years 8 months ago
2008
Given a 3D solid model S represented by a tetrahedral mesh, we describe a novel algorithm to compute a hierarchy of convex polyhedra that tightly enclose S. The hierarchy can be b...
ML
2000
ACM
13 years 8 months ago
2000
ACM
We present an approach to inductive concept learning using multiple models for time series. Our objective is to improve the efficiency and accuracy of concept learning by decomposi...