Sciweavers

569 search results - page 29 / 114
» An efficient clustering method for k-anonymization
Sort
View
ICDAR
2009
IEEE
13 years 6 months ago
Geometric Centroids and their Relative Distances for Off-line Signature Verification
In this paper, we propose a new approach for symbolic representation of off-line signatures based on relative distances between centroids useful for verification. Distances betwee...
H. N. Prakash, D. S. Guru
SIGMOD
1999
ACM
183views Database» more  SIGMOD 1999»
14 years 28 days ago
OPTICS: Ordering Points To Identify the Clustering Structure
Cluster analysis is a primary method for database mining. It is either used as a stand-alone tool to get insight into the distribution of a data set, e.g. to focus further analysi...
Mihael Ankerst, Markus M. Breunig, Hans-Peter Krie...
ICPR
2010
IEEE
14 years 3 months ago
Pose Estimation of Known Objects by Efficient Silhouette Matching
Pose estimation is essential for automated han- dling of objects. In many computer vision applications only the object silhouettes can be acquired reliably, because untextured or s...
Christian Reinbacher, Matthias Rüther, Horst Bisc...
BMCBI
2006
127views more  BMCBI 2006»
13 years 8 months ago
Exploring supervised and unsupervised methods to detect topics in biomedical text
Background: Topic detection is a task that automatically identifies topics (e.g., "biochemistry" and "protein structure") in scientific articles based on infor...
Minsuk Lee, Weiqing Wang, Hong Yu
ICDE
2009
IEEE
171views Database» more  ICDE 2009»
14 years 10 months ago
A Framework for Clustering Massive-Domain Data Streams
In this paper, we will examine the problem of clustering massive domain data streams. Massive-domain data streams are those in which the number of possible domain values for each a...
Charu C. Aggarwal